Maybe you should think about this logically:
You need to count the amount of zeros, ones and twos in an array, and then find out which has the biggest count, correct?
Then I'll give you a push in the right direction: how about you make 3 counters, and for every occurrence of one of the numbers, you increment the corresponding counter by 1. After you've gone through the entire array, you test which number is the biggest, and there you go, counting made simple.
What I don't understand though, is what that parameter "int numToFind" has anything to do with whatever you're trying to do. Why are you searching for a specific number?