如何比较两个未排序的int数组中的值？

Question

I need to find the same values (if there is) in both int arrays. I think it would work with Binary Search but i don't know exacly how to do it. eg:

    g1[95 78 99 95 35 65 95]
    g2[67 100 95 76 95 99 60]

    the function returns 2 (for 95 and 99).

Answer 1

You could use Enumerable.Intersect :

int[] duplicates = g1.Intersect(g2).ToArray();

If you just want to know the number of duplicates:

int duplicates = g1.Intersect(g2).Count();

Answer 2

You can use LINQ Intersect

        var g1 = new[] { 95, 78, 99, 95, 35, 65, 95 };
        var g2 = new[] { 67, 100, 95, 76, 95, 99, 60 };
        var result = g1.Intersect(g2).Count();

Answer 3

Var duplicates = g1.Intersect(g2).Count();

希望能帮助到你。

Answer 4

Try this

            int[] g1 = { 95, 78, 99, 95, 35, 65, 95 };
            int[] g2 = { 67, 100, 95, 76, 95, 99, 60 };

            int[] results = g1.Where(x => g2.Contains(x)).Distinct().ToArray();

Answer 5

A nested for each should do:

void a(int[] g1, int[] g2)
{
    int counter = 0;
    foreach (var x in g1)
    {
        foreach (var y in g2)
        {
            if (y == x) counter++;
        }
    }
}

Answer 6

Try this

int compare(int g1[], int g2[])
{
    int count = 0;
    for(int i=0; i < g1.length; i++)
    {
        for(int j=0; j < g2.length; j++)
        {
          if(g1[i] == g2[j])
            count = count + 1;
        }
    }
    return count;
}

This code compare each array element of g1 with all of the second(g2), if he find a element equal increments the counter. The code is a little big, but I think it's easier for you to understand how it works

Answer 7

使用相交var r = g1.Intersect（g2）并使用foreach循环从r获取值。