day31● 455.分发饼干 ● 376. 摆动序列 ● 53. 最大子序和

455.分发饼干

大的要尽量满足大的胃口，饼干为给孩子之后才能继续向下遍历

int cmp(int* a, int* b) {
    return *a - *b;
}

int findContentChildren(int* g, int gSize, int* s, int sSize){
   


    qsort(g, gSize, sizeof(int), cmp);
    qsort(s, sSize, sizeof(int), cmp);

    int count = 0;
    int start = sSize - 1;

    for(int i = gSize - 1; i >= 0; i--) {
        if(start >= 0 && s[start] >= g[i] ) {
            start--;
            count++;
        }
    }
    return count;
}

摆动序列

int wiggleMaxLength(int* nums, int numsSize){
    if(numsSize <= 1) 
        return numsSize;

    int length = 1;
    int preDiff , curDiff;
    preDiff = curDiff = 0;
    for(int i = 0; i < numsSize - 1; ++i) {
        curDiff = nums[i+1] - nums[i];
        if((curDiff > 0 && preDiff <= 0) || (preDiff >= 0 && curDiff < 0)) {
            preDiff = curDiff;
            length++;
        }
    }

    return length;
}

最大子序和

int maxSubArray(int* nums, int numsSize){
    int maxVal = INT_MIN;
    int subArrSum = 0;
    
    int i;
    for(i = 0; i < numsSize; ++i) {
        subArrSum += nums[i];
        maxVal = subArrSum > maxVal ? subArrSum : maxVal;
        subArrSum = subArrSum < 0 ? 0 : subArrSum;
    }

    return maxVal;
}