[LeetCode]169. Majority Element

Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.
You may assume that the array is non-empty and the majority element always exist in the array.
分析：查找主序元素，即在整数数组中是否存在出现次数超过一半的数字

解题思路:主序元素出现的次数要大于其他元素出现次数之和。遍历数组，当数组的第一个元素出现时，将出现次数times记为1，之后若出现相同的元素，则times++；如果元素不同，则将times–，如果times小于0，则将当前元素记为标记元素，times设置为1。遍历完后选出标记元素并判断元素出现次数是否过半。

public int majorityElement(int[] nums) {
        int times = 1;
        int c = nums[0];

        for(int i=1;i<nums.length;i++){
            if(nums[i]==c){
                times++;
            }else{
                times--;
                if(times==0){
                    c = nums[i];
                    times = 1;
                }
            }
        }

        int count = 0;
        if(times>=1){
            for(int i=0;i<nums.length;i++){
                if(c==nums[i])count++;
            }
        }
        if(count>=nums.length/2){
            return c;   
        }else{
            return -1;
        }
    }