首页 > 其他 > 详细

Major Element

时间:2018-05-21 10:05:53      阅读:35      评论:0      收藏:0      [点我收藏+]

标签:array   pub   col   --   clas   sum   always   style   count   

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.

Example 1:

Input: [3,2,3]
Output: 3

Example 2:

Input: [2,2,1,1,1,2,2]
Output: 2


class Solution {
    public int majorityElement(int[] nums) {
        int result = 0, count = 0;
        for (int i = 0; i < nums.length; i++) {
            if (count == 0) {
                result = nums[i];
            }
            
            if (nums[i] == result) {
                count++;
            } else {
                count--;  
            }
        }
        
        return result;
    }
}

 

Major Element

标签:array   pub   col   --   clas   sum   always   style   count   

原文:https://www.cnblogs.com/amazingzoe/p/9065566.html

(0)
(0)
   
举报
评论 一句话评论(0
0条  
登录后才能评论!
© 2014 bubuko.com 版权所有 鲁ICP备09046678号-4
打开技术之扣,分享程序人生!
             

鲁公网安备 37021202000002号