lllllldxsd的博客

查找算法c++

添加链接描述

多数元素 class Solution { public: int majorityElement(vector& nums) { int tar = nums[0], times = 1; for(int i = 1; i < nums.size(); i++){ if(times == 0){ tar = nums[i]; times = 1; } else if(nums[i] != tar) times–; else times++; } return tar; } }; 最