LeetCoden难题收藏

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;
    }
};

78. Subsets