Day2有序数组的平方&长度最小的子数组

有序数组的平方

/**
 * Note: The returned array must be malloced, assume caller calls free().
 */

int* sortedSquares(int* nums, int numsSize, int* returnSize){
    *returnSize=numsSize;
    int slow=0,fast=numsSize-1;
    //新数组
    int* ans=(int*)malloc(numsSize*sizeof(int));
    int i=numsSize-1;
    while(slow<=fast)
    {
        int left = nums[slow]*nums[slow];
        int right = nums[fast]*nums[fast];
        if( left >= right )
        {
            ans[i--]=left;
            slow++;
        }
        else 
        {
            ans[i--]=right;
            fast--;
        }
    }
    return ans;
}

长度最小的子数组

int minSubArrayLen(int target, int* nums, int numsSize){
    int start=0; int end=0;
    int sum=0;
    int length = INT32_MAX;
    //start是窗口开头，end是窗口结尾
    for( int end=0; end<numsSize; end++ )
    {
        sum+=nums[end];
        while( sum>=target )
        {
            int sublength = end-start+1 ;
            length = length<sublength ? length : sublength;
            sum-=nums[start++];
        }
    }

    return length==INT32_MAX ? 0:length;
}