1124. Longest Well-Performing Interval

1. Use brute force:

//TLE
class Solution {
public:
    int longestWPI(vector<int>& hours) {
        int longest = 0;
        for(int i = 0; i < hours.size(); i++){
            longest = max(longest, longestWPI(hours, i));
        }
        return longest;
    }
private:
    int longestWPI(vector<int>& hours, int init){
        int longest = 0;
        int non_tiring = 0;
        int tiring = 0;
        for(int i = init; i < hours.size(); i++){
            if(hours[i] <= 8)
                non_tiring++;
            else
                tiring++;
            if(tiring > non_tiring)
                longest = i - init + 1;
        }
        return longest;
    }
};

2. Use sliding window