Home > Algoritmo, Java, Mini-tips, Programación, Tips > Simple Moore Majority Algorithm

Simple Moore Majority Algorithm

Assuming there is always a majority number and that the array has length > 0


public int mooreMajority(int nums[]){
        int result = 0, count = 0;
        for(int x : nums){
            if(count == 0) result = x;
            if(x == result) count++;
            else count--;
        }
        return result;
}
  1. No comments yet.
  1. No trackbacks yet.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: