首页 > 其他 > 详细

169. Majority Element

时间:2018-04-14 23:19:46      阅读:300      评论:0      收藏:0      [点我收藏+]
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.

 

 1 class Solution {
 2     public int majorityElement(int[] x) {
 3         int res = x[0];
 4         int cnt = 1;
 5         int n = x.length;
 6         for(int i = 1;i<n;i++){
 7             
 8             if(x[i]==res)
 9                 cnt++;
10             else{
11                 cnt--;
12                 if(cnt==0){
13                 cnt=1;
14                 res=x[i];
15             }
16             }
17         }
18         cnt = 0;
19         for(int i =0;i<n;i++)
20             if(x[i]==res)
21                 cnt++;
22         if(cnt>=n/2)
23             return res;
24         return 0;
25     }
26 }

 

169. Majority Element

原文:https://www.cnblogs.com/zle1992/p/8836507.html

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