Question

/**
                Given an int array, return an int array with duplicate ints removed if the array contains duplicate values. <br> <br>

                removeDuplicateInts({3})  -> {3} <br>
                removeDuplicateInts({1, 2})  -> {1, 2} <br>
                removeDuplicateInts({7, 7})  -> {7} <br>
                removeDuplicateInts({1, 7, 1, 7, 1})  -> {1, 7} <br>
                removeDuplicateInts({1, 2, 3, 4, 5})  -> {1, 2, 3, 4, 5}) <br>
                removeDuplicateInts({1, 2, 3, 2, 4, 2, 5, 2})  -> {1, 2, 3, 4, 5} <br>
                @param numbers int[] an array of integers.
                @return int[] An array with the duplicates removed.
        **/
        public static int[] removeDuplicateInts(int[] numbers) {
                //your code here
                        return numbers;
                } // end removeDuplicateInts

Answer 1

public static int[] removeDuplicateInts(int[] numbers) {
    int uniqueLength = 0;
    boolean duplicateFound;
    for (int i = 0; i < numbers.length; ++i) {
        duplicateFound = false;
        for (int j = 0; j < i; ++j) {
            if (numbers[i] == numbers[j]) duplicateFound = true;
        }
        if (!duplicateFound) {
            uniqueLength++;
        }
    }
    int[] result = new int[uniqueLength];
    int ind = 0;
    for (int i = 0; i < numbers.length; ++i) {
        duplicateFound = false;
        for (int j = 0; j < i; ++j) {
            if (numbers[i] == numbers[j]) duplicateFound = true;
        }
        if (!duplicateFound) {
            result[ind++] = numbers[i];
        }
    }
    return result;
}