代码随想录第二天，977、209、59

977.有序数组的平方，注意利用给的数组是有序数组这一特点，最大最小值只出现在左右，所以可以利用双指针法降低复杂度，代码如下：

#include <vector>
#include <iostream>
#include <cmath>
#include <math.h>

std::vector<int> sortedSquares(const std::vector<int>& nums){
    int n = nums.size();
    std::vector<int> res(n); //忘记初始化容器时怎么给容器大小赋值了
    int left = 0;
    int right = n - 1;
    int pos = n - 1;

    while(left <= right){
        int leftsquare = nums[left] * nums[left];
        int rightsquare = nums[right] * nums[right];
        if( leftsquare <= rightsquare ){
            res[pos] = rightsquare;
            right--;
        }else{
            res[pos] = leftsquare;
            left++;
        }
        pos--;
    }
    return res;

}

int main(){
    std::vector<int> nums = {-4, -1, 0, 3, 10};
    std::vector<int> res = sortedSquares(nums);
    for(int i = 0; i < res.size(); i++){
        std::cout << res[i] <<" ";
    }
    std::cout << std::endl;
}

209长度最小的子数组，解决这种问题最有效的方法是滑动窗口，代码如下：

#include <iostream>
#include <vector>
#include <climits>  // INT_MAX

int minSubArrayLen(int s, std::vector<int>& nums) {
    int n = nums.size();
    int start = 0, end = 0;
    int sum = 0;
    int minLength = INT_MAX;

    while (end < n) {
        // 扩展窗口
        sum += nums[end];
        end++;

        // 当窗口满足条件时，尝试收缩窗口
        while (sum >= s) {
            minLength = std::min(minLength, end - start);
            sum -= nums[start];
            start++;
        }
    }

    // 如果minLength没有被更新，说明没有找到符合条件的子数组
    return minLength == INT_MAX ? 0 : minLength;
}

int main() {
    std::vector<int> nums = {2, 3, 1, 2, 4, 3};
    int s = 7;
    std::cout << "Minimum length of subarray: " << minSubArrayLen(s, nums) << std::endl;
    return 0;
}

59螺旋矩阵，注意区间就行，没什么好说的

#include <iostream>
#include <vector>

std::vector<std::vector<int>> generateMatrix(int n) {
    std::vector<std::vector<int>> matrix(n, std::vector<int>(n));
    int num = 1, top = 0, bottom = n - 1, left = 0, right = n - 1;

    while (top <= bottom && left <= right) {
        // 从左到右
        for (int i = left; i <= right; i++) {
            matrix[top][i] = num++;
        }
        top++;

        // 从上到下
        for (int i = top; i <= bottom; i++) {
            matrix[i][right] = num++;
        }
        right--;

        // 从右到左
        if (top <= bottom) {
            for (int i = right; i >= left; i--) {
                matrix[bottom][i] = num++;
            }
            bottom--;
        }

        // 从下到上
        if (left <= right) {
            for (int i = bottom; i >= top; i--) {
                matrix[i][left] = num++;
            }
            left++;
        }
    }

    return matrix;
}

int main() {
    int n = 3;
    std::vector<std::vector<int>> result = generateMatrix(n);

    for (const auto &row : result) {
        for (int num : row) {
            std::cout << num << " ";
        }
        std::cout << std::endl;
    }

    return 0;
}