class Solution {
public:
int majorityElement(vector<int>& nums) {
if (nums.size() == 0) { return 0; }
int flag = nums[0];
int count = 1;
for (int i = 1; i < nums.size(); ++i) {
if (nums[i] == flag) {
count++;
}
else {
count--;
}
if (count == 0) {
flag = nums[i];
count = 1;
}
}
return flag;
}
};
【数组】【俩俩抵消】leetcode.169. 多数元素
最新推荐文章于 2022-07-18 22:50:08 发布