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

题目链接：977.有序数组的平方

class Solution {
public:
    vector<int> sortedSquares(vector<int>& nums) {
        int len = nums.size();
        for(int i = 0; i < len; i++){
            nums[i] = nums[i] * nums[i];
        }
        sort(nums.begin(), nums.end());
        return nums;
    }
    
};

题目链接：209.长度最小的子数组

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

题目链接：59.螺旋矩阵II

class Solution {
public:
    vector<vector<int>> generateMatrix(int n) {
        vector<vector<int>> res(n, vector<int>(n, 0));
        int startx = 0,starty = 0;
        int i,j;
        int offset = 1;
        int loop = n / 2;
        int count = 1;
        while(loop--){
            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 == 1){
            res[n/2][n/2] = count;
        }
        return res;
    }
};

感想

卡哥的视频真是通俗易懂，一点就通，今天的第三题一开始没看懂，看了讲解视频茅塞顿开，相信坚持下去会有好结果。