首页 > 其他 > 详细

[LeetCode]Majority Element II

时间:2015-11-28 10:31:55      阅读:169      评论:0      收藏:0      [点我收藏+]
public class Solution {
    public List<Integer> majorityElement(int[] nums) {
        int can1 = 0, can2 = 0, num1 = 0, num2 = 0;
        for (int num : nums) {
            if (num1 == 0 || can1 == num) {
                can1 = num;
                num1 ++;
            } else if (num2 == 0 || can2 == num) {
                can2 = num;
                num2 ++;
            } else {
                num1 --;
                num2 --;
            }
        }
        num1 = 0;
        num2 = 0;
        for (int num : nums) {
            if (num == can1) {
                num1 ++;
            } else if (num == can2) {
                num2 ++;
            }
        }
        List<Integer> result = new ArrayList<Integer>();
        if (num1 > nums.length / 3) {
            result.add(can1);
        }
        if (num2 > nums.length / 3) {
            result.add(can2);
        }
        return result;
    }
}

 

[LeetCode]Majority Element II

原文:http://www.cnblogs.com/vision-love-programming/p/5002148.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!