剑指offer之数组中出现次数超过一半的数字

 1 public class Solution {
 2     public int MoreThanHalfNum_Solution(int [] array) {
 3         if(array == null || array.length == 0){
 4             return 0;
 5         }
 6         int count = 0;
 7         int num = array[0];
 8         for(int i = 0;i< array.length; i++){
 9             //如果count==0,将下一个值赋给num
10             if(count == 0 && (i+1)<array.length){
11                 num = array[i+1];
12             }
13             //如果遇见相同的元素，count++
14             if(num == array[i]){
15                 count = count + 1;
16             }else{    //如果遇见不相同的元素，count--
17                 count = count - 1;
18             }
19         }
20         //遍历num的个数
21         int number =  0;
22         for(int i = 0; i < array.length; i++){
23             if(array[i] == num){
24                 number++;
25             }
26         }
27         //判断num的个数是否大于数组长度的一半
28         if(number > array.length/2){
29             return num;
30         }else{
31             return 0;
32         }
33     }
34 }