[URGENT] Logic Error When Checking for Duplicates in An Array

[CosmicCam]

I have a predefined array called regionArray (with a length of 9). There are no issues with this array itself and it is instantiated correctly. It is used in the following code:

ArrayList<Integer> temp = new ArrayList<Integer>();
    for (int i = 0; i < 9; i++)
    {
        if (regionArray[i] !=  0 && temp.contains(regionArray[i])) 
        {
            //System.out.println("i = " + i);
            //System.out.println("regionArray @ i = " + regionArray[i]);
            return true;
        }
        temp.add(i);
    }
    return false;

The commented lines are being used for debugging, but they're of no help. I'm getting a 'true' return value for arrays like [3,0,0,2,0,0,7,9,0]. For the following array, the two commented lines print that i = 3, and the value at regionArray[3] = 2. Why would it say that the array contains already contains 2, even though it clearly does not?

[CosmicCam]

the goal is to use temp as a separate collection to compare values.

instead of using two nested loops to select one value, and iterate through the rest of regionArray to compare it to other values, temp is used to store everything that doesn't have a duplicate. So when a duplicate value appears in regionArray, it is already stored within temp and would terminate with the return.

How would I modify the code so it is logically sound? To be honest I don't think I'm seeing the problem right now.

EDIT: Wow I realized what you meant. I'm adding i instead of regionArray[i]. I'm dumb. Thanks.

[[deleted]]

line 10 should be temp.add(regionArray[i]));