1. 题目原址
https://leetcode.com/problems/majority-element/
2. 题目描述
3. 题目大意
给定一个一维数组,返回数组中出现次数大于元素总数一半的元素值
4. 解题思路
不需要排序,如果当前元素和前面的元素不一样,就将count–, 如果一样,就将count++。
5. AC代码
class Solution {
public int majorityElement(int[] nums) {
int cur_num =0;
int count =0;
for(int num: nums){
if(count ==0){
cur_num = num;
count++;
}else{
if(num == cur_num){
count++;
}else{
count--;
}
}
}
return cur_num;
}
}
6. 相似题型
【1】229. Majority Element II 题目原址:https://leetcode.com/problems/majority-element-ii/