代码随想录算法训练营第三十一天|455. 分发饼干、376. 摆动序列、53. 最大子数组和

455. 分发饼干

public class Solution {
    public int FindContentChildren(int[] g, int[] s) {
        Array.Sort(g);
        Array.Sort(s);
        int result = 0;
        int index = s.Length - 1;
        for(int i = g.Length - 1;i>=0;i--)
        if(index >= 0 && s[index]>=g[i])
        {
            result++;
            index--;
        }
        return result;
    }
}

376. 摆动序列

public class Solution {
    public int WiggleMaxLength(int[] nums) {
        int result = 1;
        int curDiff = 0;
        int preDiff = 0;
        for(int i = 0;i < nums.Length-1;i++)
        {
            curDiff = nums[i]-nums[i+1];
            if(curDiff > 0 && preDiff <=0 || curDiff < 0 && preDiff >=0) 
            {
                result++;
                preDiff = curDiff;
            }
        }
        return result;
    }
}

53. 最大子数组和

public class Solution {
    public int MaxSubArray(int[] nums) {
        int count = 0;
        int result = Int32.MinValue;
        for(int i = 0;i < nums.Length;i++)
        {
            count+=nums[i];
            if(count > result) result = count;
            if(count <0)count = 0;
        }
        return result;
    }
}