码迷,mamicode.com
首页 > 其他好文 > 详细

LeetCode:Majority Element II

时间:2016-06-16 14:58:45      阅读:185      评论:0      收藏:0      [点我收藏+]

标签:

Majority Element II

 My Submissions
Total Accepted: 30176 Total Submissions: 115847 Difficulty: Medium

Given an integer array of size n, find all elements that appear more than ? n/3 ? times. The algorithm should run in linear time and in O(1) space.

Hint:

  1. How many majority elements could it possibly have?
  2. Do you have a better hint? Suggest it!

Subscribe to see which companies asked this question

Hide Tags
 Array
Hide Similar Problems
 (E) Majority Element


















思路:

最多只能有两个数符合结果,因此用两个变量,计算它们是否超过? n/3 ?

java code:

public class Solution {
    public List<Integer> majorityElement(int[] nums) {
        
        List<Integer> ans = new ArrayList<Integer>();
        if(nums == null || nums.length == 0) return ans;
        int x = 0, y = 1;
        int cx = 0, cy = 0;
        for(int num : nums) {
            
            if(num == x) {
                cx++;
            }
            else if(num == y) {
                cy++;
            }
            else if(cx == 0) {
                x = num;
                cx = 1;
            }
            else if(cy == 0) {
                y = num;
                cy = 1;
            }
            else {
                cx--;
                cy--;
            }
        }
        cx = cy = 0;
        for(int num : nums) {
            if(num == x) cx++;
            else if(num == y) cy++;
        }
        if(cx > nums.length/3) ans.add(x);
        if(cy > nums.length/3) ans.add(y);
        
        return ans;
    }
}


LeetCode:Majority Element II

标签:

原文地址:http://blog.csdn.net/itismelzp/article/details/51685255

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!