代码随想录训练营第二天|977.有序数组的平方，209.长度最小的子数组，59螺旋矩阵

有序数组的平方

第一眼的思路是暴力解法，先给出新数组的平方，再排序，双指针想了会不会

自己动手完全不会

class Solution {
public:
    vector<int> sortedSquares(vector<int>& nums) {
        int k = nums.size() - 1;
        vector<int> result(nums.size(), 0);
        for (int i = 0, j = k; i <= j;){
            if ((nums[i] * nums[i]) < (nums[j] * nums[j])) {
                result[k--] = (nums[j] * nums[j]);
                j--;
            }
            else {
                result[k--] = (nums[i] * nums[i]);
                i++;
            }
            }
        return result;
        
    }
};

长度最小的子数组

没思路，完全不会

class Solution {
public:
    int minSubArrayLen(int target, vector<int>& nums) {
        int result = INT32_MAX;
        int sum = 0; 
        int i = 0;
        int subLength = 0;
        for (int j = 0; j < nums.size(); j++) {
            sum += nums[j];
            while (sum >= target) {
                subLength = (j - i +1);
                result = result < subLength ? result : subLength;
                sum -= nums[i++];
            }
        }
        return result == INT32_MAX ? 0 : result;
    }
};

螺旋矩阵

更加不会

class Solution {
public:
    vector<vector<int>> generateMatrix(int n) {
        vector<vector<int>> res(n, vector<int>(n, 0)); 
        int startx = 0, starty = 0;
        int offset = 1;
        int loop = n/2;
        int mid = n/2;
        int count = 1;
        int i,j;
        while (loop--) {
            i = startx;
            j = starty;
            for (j = starty; j < n - offset; j++) {
                res[startx][j] = count++;
            }
            for (i = startx; i < n - offset; i++) {
                res[i][j] = count++;
            }
            for (;j > starty; j--) {
                res[i][j] = count++;
            }
            for (;i > startx; i--) {
                res[i][j] = count++;
            }
            startx++;
            starty++;
            offset++;
        }
        if (n % 2) {
            res[mid][mid] = count;
        }
        return res;
    }
};

我太菜了，这看到一点思路都没有