LeetCode难题收藏
818. Race Car
815. Bus Routes
76. Minimum Window Substring
485. Max Consecutive Ones
注意思考该题解法:
class Solution {
public:
int findMaxConsecutiveOnes(vector<int>& nums) {
int res = 0, cnt = 0;
for (int num : nums) {
cnt = (num == 0) ? 0 : cnt + 1;
res = max(res, cnt);
}
return res;
}
};