代码随想录Day2 977

977有序数组的平方和

一开始想不到要怎么用双指针
思路：平方计算完成后再按大小排序

/**
 * Note: The returned array must be malloced, assume caller calls free().
 */
int cmp(const void *a, const void *b){
    return *(int *)a - *(int *)b;
}

int* sortedSquares(int* nums, int numsSize, int* returnSize){
    int i;
    *returnSize = numsSize;
    for(i = 0;i<numsSize;i++)
    {
        nums[i]=nums[i]*nums[i];
    }
    qsort(nums,numsSize,sizeof(int),cmp);

    return nums;

}

双指针写法
改写法定义新数组时只能用malloc不能单纯的int name[size]

/**
 * Note: The returned array must be malloced, assume caller calls free().
 */
//双指针：数组有序排列不过因为有负数存在可能会出现左边的是最大值从两头开始，两指针从两头开始，构建一个从尾部开始的新数组将最大值赋到新数组的末尾

int* sortedSquares(int* nums, int numsSize, int* returnSize){
    int i = 0,j = numsSize-1;
    int* re = (int*)malloc(sizeof(int)*(numsSize));
    int k = numsSize-1;
    *returnSize = numsSize;
    while(i<=j)
    {
        int l = nums[i]*nums[i];
        int r = nums[j]*nums[j];
        if(l>r)
        {
            re[k--] = l;
            i++;
        }
        else
        {
            re[k--] = r;
            j--;
        }
    }

    return re;
}

209.长度最小的子数组

暴力解法会超时

int minSubArrayLen(int target, int* nums, int numsSize){
    int i,j;
    int count = 0;
    int min = 200;
    for(i=0;i<numsSize;i++)
    {
        int to = 0;
        for(j=i;j<numsSize;j++)
        {
            to+=nums[j];
            if(to>=target) 
            {
                count = j+1-i;
                if(count<min)
                min = count;

                break;
            }
        }
    }
    if(min == 200)
    return 0;
    else
    return min;
}

解法：滑动窗口
j指向尾端 满足条件i向后移动

int minSubArrayLen(int target, int* nums, int numsSize){
    int j = 0;
    int re = INT_MAX;
    int sum = 0;
    int to;
    int i =0;
    for(j = 0;j < numsSize;j++)
    {
        
        sum+=nums[j];
        to = j+1-i;
        while(sum>=target)
        {
            to = j+1-i;
            sum-=nums[i++];
            re = fmin(re,to);
        }
    }

    return re == INT_MAX?0:re;
}

搞清楚时间复杂度问题for里套while不一定是n方，每个元素进出被操作两次应是2*n

59 螺旋矩阵

语法和逻辑都没搞明白明天早起再试试
循环不变量确定边界

int** generateMatrix(int n, int* returnSize, int** returnColumnSizes){
    //初始化返回的结果数组的大小
    *returnSize = n;
    *returnColumnSizes = (int*)malloc(sizeof(int) * n);
    //初始化返回结果数组ans
    int** ans = (int**)malloc(sizeof(int*) * n);
    int i;
    for(i = 0; i < n; i++) {
        ans[i] = (int*)malloc(sizeof(int) * n);
        (*returnColumnSizes)[i] = n;
    }

    //设置每次循环的起始位置
    int startX = 0;
    int startY = 0;
    //设置二维数组的中间值，若n为奇数。需要最后在中间填入数字
    int mid = n / 2;
    //循环圈数
    int loop = n / 2;
    //偏移数
    int offset = 1;
    //当前要添加的元素
    int count = 1;

    while(loop) {
        int i = startX;
        int j = startY;
        //模拟上侧从左到右
        for(; j < startY + n - offset; j++) {
            ans[startX][j] = count++;
        }
        //模拟右侧从上到下
        for(; i < startX + n - offset; i++) {
            ans[i][j] = count++;
        }
        //模拟下侧从右到左
        for(; j > startY; j--) {
            ans[i][j] = count++;
        }
        //模拟左侧从下到上
        for(; i > startX; i--) {
            ans[i][j] = count++;
        }
        //偏移值每次加2
        offset+=2;
        //遍历起始位置每次+1
        startX++;
        startY++;
        loop--;
    }
    //若n为奇数需要单独给矩阵中间赋值
    if(n%2)
        ans[mid][mid] = count;

    return ans;
}