题解 | #数组中出现次数超过一半的数字#

import java.util.*;

public class Solution {
    public int MoreThanHalfNum_Solution(int [] array) {
	  if(array == null) {
		return 0;
	  }
        int len = array.length;
        int num = 0;
        Map<Integer, Integer> map = new HashMap<>();
        for(int i = 0; i < len; i++) {
           
          int count = map.getOrDefault(array[i], new Integer(0));
          map.put(array[i], count + 1);

          // 如果包含则判断次数是否达够
          if(map.containsKey(array[i]) && map.get(array[i]) > len/2) {
              num = array[i];
              break;
          }
        }
        return num;
    }
}