Question

Java:

Write a class ArrayIntersection that implements the method below.

public static int[] get(int[] one, int[] two)

Given two arrays, it returns a new array with all values that are in both arrays.

The returned array has a size fitting its elements exactly and without duplicates. The order of values does not matter. For example, given {1,5,5,1} and {5,3}, the method returns {5}.

Answer 1

public class ArrayIntersection {

    public static int[] get(int[] one, int[] two) {
        int count = 0;
        boolean found;
        for (int i = 0; i < one.length; i++) {
            found = false;
            for (int j = 0; j < two.length; j++) {
                if (one[i] == two[j]) {
                    found = true;
                }
            }
            if (found) {
                found = false;
                for (int j = 0; j < i; j++) {
                    if (one[i] == one[j]) {
                        found = true;
                    }
                }
                if (!found) {
                    ++count;
                }
            }
        }
        int[] result = new int[count];
        int index = 0;
        for (int i = 0; i < one.length; i++) {
            found = false;
            for (int j = 0; j < two.length; j++) {
                if (one[i] == two[j]) {
                    found = true;
                }
            }
            if (found) {
                found = false;
                for (int j = 0; j < i; j++) {
                    if (one[i] == one[j]) {
                        found = true;
                    }
                }
                if (!found) {
                    result[index++] = one[i];
                }
            }
        }
        return result;
    }

    public static void main(String[] args) {
        int[] one = {1, 5, 5, 1};
        int[] two = {5, 3};
        int[] result = get(one, two);
        for (int i = 0; i < result.length; i++) {
            System.out.print(result[i] + " ");
        }
        System.out.println();
    }
}