您的位置:首页 > 其它

169. Majority Element (寻找多数元素)

2016-10-27 23:14 531 查看
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.

public class Solution {
public int majorityElement(int[] nums) {
int temp=nums[0],times=0;
for(int i:nums){
if(times==0){
temp = i;
}
if(temp==i)
times++;
else{
times--;
}
}
return temp;
}
}
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签:  leetcode 算法