Well, a method for finding something in an array would also have to loop through and compare to find it.

You can look into maybe using an ArrayList or HashMap, but it will always need to search in some way.

Or, you could maybe turn it around.

You could instead make counters, and see the value. If the span of ints only cover, say [0..99], you can make an array like:

1. int[] mynums = new int[100];
2. for(int i = 0; i < 100; i++) mynums[i] = 0;

And then, when you set the values, say 33

1. mynums[33]++;

so to later check if 33 is present, you just do

1. if(mynums[33] > 0) println "Success!";

As said, basically, you will have to examine a bunch of entries to find the right one, no magic here.
Now, there are some optimized ways to search, if the array is sorted, like using binary search. The Java Arrays class has this implemented for you.