前端算法系列-贪心01

455. 分发饼干

var findContentChildren = function(g, s) {
    let res = 0
    let child = g.sort((a,b) => a - b)
    let cookie = s.sort((a,b) => a - b)
    for(let i=0;i<cookie.length;i++){
        if(res < child.length && cookie[i] >= child[res]){
            res++
        }
    }
    return res
};

376. 摆动序列

贪不出来

53. 最大子数组和

var maxSubArray = function(nums) {
    let result = -Infinity
    let count = 0
    for(let i = 0; i < nums.length; i++) {
        count += nums[i]
        if(count > result) {
            result = count
        }
        if(count < 0) {
            count = 0
        }
    }
    return result
};