代码随想录训练营day2

最新推荐文章于 2024-09-27 14:28:55 发布

wenxingyu03

最新推荐文章于 2024-09-27 14:28:55 发布

阅读量176

点赞数 1

文章标签：算法数据结构

本文链接：https://blog.csdn.net/wenxingyu03/article/details/140536071

版权

一共三题

59.螺旋矩阵

这题不会看的解析

int** generateMatrix(int n, int* returnSize, int** returnColumnSizes) {
    int maxNum = n * n;
    int curNum = 1;
    int** matrix = malloc(sizeof(int*) * n);
    *returnSize = n;
    *returnColumnSizes = malloc(sizeof(int) * n);
    for (int i = 0; i < n; i++) {
        matrix[i] = malloc(sizeof(int) * n);
        memset(matrix[i], 0, sizeof(int) * n);
        (*returnColumnSizes)[i] = n;
    }
    int row = 0, column = 0;
    int directions[4][2] = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};  // 右下左上
    int directionIndex = 0;
    while (curNum <= maxNum) {
        matrix[row][column] = curNum;
        curNum++;
        int nextRow = row + directions[directionIndex][0], nextColumn = column + directions[directionIndex][1];
        if (nextRow < 0 || nextRow >= n || nextColumn < 0 || nextColumn >= n || matrix[nextRow][nextColumn] != 0) {
            directionIndex = (directionIndex + 1) % 4;  // 顺时针旋转至下一个方向
        }
        row = row + directions[directionIndex][0];
        column = column + directions[directionIndex][1];
    }
    return matrix;
}

209.长度最小的子数组

int minSubArrayLen(int target, int* nums, int numsSize){
    int minLength = INT_MAX;
    int sum = 0;
    int left = 0;
    int right = 0;

    for(right = 0; right < numsSize; right++)
    {
        sum += nums[right];
        while(sum >= target)
        {
            minLength = minLength > (right - left + 1) ? (right - left + 1) : minLength;
            sum -= nums[left++];
        } 
    } 

    return minLength == INT_MAX ? 0 : minLength;

}

977.有序数组的平方

int* sortedSquares(int* nums, int numsSize, int* returnSize) {
    *returnSize = numsSize;
    int left = 0;
    int right = numsSize-1;
    int* newNums = (int*) malloc(sizeof(int) * numsSize);
    int i = numsSize-1;

    while(right >= left)
    {
        if(nums[left]*nums[left] >= nums[right]*nums[right])
        {
            newNums[i--] = nums[left]*nums[left] ;
            left++;
        }else if(nums[left]*nums[left] < nums[right]*nums[right]){
            newNums[i--] = nums[right]*nums[right] ;
            right--;
        }
    }

    return newNums;
}