本文共 918 字,大约阅读时间需要 3 分钟。
class Solution { public: int thirdMax(vector & nums) { long long Max = -3e9, secondMax = -3e9, thirdMax = -3e9; for (int i = 0; i < nums.size(); i++) { if (nums[i] > Max) { thirdMax = secondMax; secondMax = Max; Max = nums[i]; } else { if (nums[i] > secondMax&& nums[i]!=Max) { thirdMax = secondMax; secondMax = nums[i]; } else { if (nums[i] > thirdMax&& nums[i]!=secondMax && nums[i] != Max) thirdMax = nums[i]; } } } if (thirdMax == -3e9 && secondMax == -3e9) return Max; else if (thirdMax == -3e9) return Max; else return thirdMax; }};
class Solution { public: int findMaxConsecutiveOnes(vector & nums) { int counter = 0,max=0; for (int i = 0; i < nums.size(); i++) { if (nums[i] == 1) counter++; if (max < counter) max = counter; if (nums[i] == 0) counter = 0; } return max; }};
转载地址:http://kbmki.baihongyu.com/