哈希表法
import java.util.HashMap;
public class Solution {
public int MoreThanHalfNum_Solution(int [] array) {
if(array == null || array.length == 0) {
return 0;
}
HashMap<Integer, Integer> map = new HashMap<>();
int th = array.length / 2;
for(int i = 0; i < array.length; i++) {
if(map.keySet().contains(array[i])) {
map.put(array[i], map.get(array[i]) + 1);
}else {
map.put(array[i], 1);
}
}
for(Integer key : map.keySet()) {
if(map.get(key) > th) {
return key;
}
}
return 0;
}
}