5129. 表现良好的最长时间段（数组）

/**
 * @param {number[]} hours
 * @return {number}
 */
var longestWPI = function(hours) {
    let arr = [];
    for (var i = 0; i < hours.length; i++) {
        for (var j = i+1; j <= hours.length; j++) {
            let lao=0, xiu=0, subArr = hours.slice(i, j);
            subArr.forEach(s=>{
                if(s>8){
                    lao++
                }else {
                    xiu++
                }
            })
            if(lao>xiu){
                pushArr(arr, subArr);
            }
            
        }
    }
    if(!arr.length) return 0;
    let maxLenArr = arr[0];
    for (var i = 1; i < arr.length; i++) {
        if(arr[i].length>maxLenArr.length){
            maxLenArr = arr[i]
        }
    }
    return maxLenArr.length;
};
let pushArr =function(arr, subArr){
    arr.push({
            subArr: subArr,
            length: subArr.length
        });
}

/**
 * @param {number[]} hours
 * @return {number}
 */
var longestWPI = function(hours) {
     let n = hours.length;
     let array = new Array(n);
    for(let i = 0; i < n; i++){
        if(hours[i] > 8)
            array[i] = 1;
        else
            array[i] = -1;
    }
    let ans = 0;
    for(let i = 0; i < n; i++){
        let temp = 0;
        for(let j = i; j < n; j++){
            temp += array[j];
            if(temp > 0)
                ans = Math.max(ans, j-i+1);
        }
    }
    return ans;
};