代码随想录day2 lc977, 209, 59

977. Squares of a Sorted Array
     https://leetcode.cn/problems/squares-of-a-sorted-array/
     双指针 时间复杂度: O(N)

class Solution {
public:
    vector<int> sortedSquares(vector<int>& nums) {
        vector<int>res(nums.size());
        int l = 0;
        int r = nums.size() - 1;
        int idx = r;
        while (l <= r) {
            // 每次比较两端的值，因为最大值只会在两端出现
            if (abs(nums[l]) > abs(nums[r])) {
                // 放进结果数组的末尾
                res[idx] = (nums[l] * nums[l]);
                l++;
            } else {
                res[idx] = (nums[r] * nums[r]);
                r--;
            }
            idx--;
        }
        return res;
    }
};

978. Minimum Size Subarray Sum
     https://leetcode.cn/problems/minimum-size-subarray-sum/
     滑动窗口 时间复杂度: O(N)

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

979. Spiral Matrix II
     https://leetcode.cn/problems/spiral-matrix-ii/

class Solution {
public:
    vector<vector<int>> generateMatrix(int n) {
        vector<vector<int>>res(n, vector<int>(n));
        vector<vector<int>>dir = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};
        int x = 0;
        int y = 0;
        int curr = 1;
        int idx = 0;
        while (curr <= n * n) {
            res[x][y] = curr;
            curr++;
            int xi = dir[idx][0] + x;
            int yi = dir[idx][1] + y;
            if (xi >= 0 && xi < n && yi >= 0 && yi < n && res[xi][yi] == 0) {
                x = xi;
                y = yi;
            } else {
                idx = (idx + 1) % 4;
                x = dir[idx][0] + x;
                y = dir[idx][1] + y;
            }
        }
        return res;
    }
};