leetcode:Majority Number

1、Given an array of integers, the majority number is the number that occursmore than half of the size of the array. Find it.

Given [1, 1, 1, 1, 2, 2, 2], return 1

2、得到当前数组中个数最多的一个数

3、代码

　　

public class MajorityNumber {
    public static  int majorityNumber(ArrayList<Integer> nums) {
        int count = 0, candidate = -1;
        for (int i = 0; i < nums.size(); i++) {
            /**
             * 1、得到初始化的值
             * 2、将值的个数进行判断
             * 3、若相同，得到的是第一个值
             */
            if (count == 0) {
                //得到第一个值
                candidate = nums.get(i);
                //当前个数为1
                count = 1;
            } else if (candidate == nums.get(i)) {
                count++;
            } else {
                count--;
            }
        }
        return candidate;
    }
}