码随想录算法训练营第02天

977.有序数组的平方

题目链接
https://leetcode.cn/problems/minimum-size-subarray-sum/

class Solution {
public:
    vector<int> sortedSquares(vector<int>& nums) {
        vector<int> res;
        for (int i = 0, j = nums.size() - 1; i <= j; ) {
            res.push_back(pow(nums[i], 2) >= pow(nums[j], 2) ? pow(nums[i++], 2) : pow(nums[j--], 2));
        }
        int tmp;
        for (int i = 0, j = nums.size() - 1; i < j; ++i, --j) {
            tmp = res[i];
            res[i] = res[j];
            res[j] = tmp;
        }
        return res;
    }
};

209.长度最小的子数组

题目链接：
https://leetcode.cn/problems/minimum-size-subarray-sum/

class Solution {
public:
    int minSubArrayLen(int target, vector<int>& nums) {
        int len = nums.size() + 1;
        int sum = 0;
        for (int i = 0, j = 0; i < nums.size() && j <= nums.size(); ++ i) {
            while (j < nums.size() && sum < target) sum += nums[j ++];
            // cout << i << " " << j << " " << sum << endl;
            if (sum >= target && j - i < len) {
                len = j - i;
            }
            sum -= nums[i];
        }
        return len == nums.size() + 1 ? 0 : len;
    }
};

59.螺旋矩阵II

题目链接：
https://leetcode.cn/problems/spiral-matrix-ii/

class Solution {
public:
    vector<vector<int>> generateMatrix(int n) {
        vector<vector<int>> matrix(n, vector<int>(n, 0));
        int cnt = 1;
        int rl = 0, rr = n - 1;
        int cl = 0, cr = n - 1;
        for (int r = rl, c = cl; r <= rr && c <= cr && rl <= rr; r ++, c ++) {
            // cout << rl << " " << rr << " " << cl << " " << cr << endl;
            for ( ; c <= cr; c ++) {
                // cout << r << " " << c << " " << cnt << endl;
                matrix[r][c] = (cnt ++);
            }
            r += 1; c -= 1;
            for ( ; r <= rr; r ++) {
                // cout << r << " " << c << " " << cnt << endl;
                matrix[r][c] = (cnt ++);
            }
            r -= 1; c -= 1;
            for ( ; c >= cl; c --) {
                // cout << r << " " << c << " " << cnt << endl;
                matrix[r][c] = (cnt ++);
            }
            r -= 1; c += 1;
            for ( ; r > rl; r --) {
                // cout << r << " " << c << " " << cnt << endl;
                matrix[r][c] = (cnt ++);
            }
            rl ++;
            rr --;
            cl ++;
            cr --;
        }
        return matrix;
    }
};