The Boyer-Moore Majority Vote Algorithm
int[] is too strong a requirement. The code does not do any random access. Consider changing an argument from array to stream (this way you may process data not fitting in memory).
The method does two (technically) unrelated jobs: finding the maybe dominant element, and verification that the element is indeed dominant. I recommend splitting it into two methods, for the following reasons:


Each loop does an important job and deserves a name.
If it is guaranteed that the dominant element exists, verification is a waste of time.
If it is guaranteed that the dominant element exists, the requirements can be relaxed even more to an input iterator.

Do not print anything from the algorithm. Let main handle results.