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

deuspio

已于 2023-07-31 22:04:59 修改

阅读量524

点赞数 2

文章标签：算法 leetcode 数据结构

于 2023-07-28 14:53:49 首次发布

本文链接：https://blog.csdn.net/deuspio/article/details/131978139

版权

977.有序数组的平方

代码随想录 (programmercarl.com)

力扣

思路：双指针

环境：两边大，中间小，有序

易错点：加到新的数组中，所以left = right 是最后一个数，要在while中判断

class Solution {

public:
    vector<int> sortedSquares(vector<int>& nums) {
        int left = 0;
        int right = nums.size() - 1;
        vector<int> result;
        while(left <= right){
            int leftsqr = nums[left] * nums[left] ;
            int rightsqr = nums[right] * nums[right];
            if(leftsqr >= rightsqr){
                result.push_back(leftsqr);
                left++;
            }else{
                result.push_back(rightsqr);
                right--;
            }

        }
        reverse(result.begin(),result.end());
        return result;
    }
};

209.长度最小的子数组

力扣

代码随想录

难点：双指针，滑动窗口

重点：长度为right - left + 1

class Solution {

public:
    int minSubArrayLen(int target, vector<int>& nums) {
        int left = 0;
        int right = 0;

        int result = INT_MAX;
        int sum = 0;
        for(right = 0; right < nums.size();right++){

            sum += nums[right];

            while(sum >= target){
                
                result = min(result, right - left + 1);
                
                sum -= nums[left];
                left++;
                
            }
        }
        if(result == INT_MAX) return 0;
        return result;
    }
};

59.螺旋矩阵II

力扣

代码随想录

class Solution {
    //难点： 边缘判断
public:
    vector<vector<int>> generateMatrix(int n) {

        //定义2维，全为0的数组。 n为个数，0为填充物为0
        vector<vector<int>> result(n, vector<int>(n, 0));
        int count = 1;
        int startX = 0;
        int startY = 0;
        int offset = 1;
        int roundCount = 0;
        int i,j;
        //转圈数
        while(roundCount <  (int)n/2 ){
            i = startX;
            j = startY;

            for(j = startY; j < n - offset; j++){
                result[i][j] = count;
                count++;
            }
            
            
            for(i = startX; i < n - offset; i++){
                result[i][j] = count;
                count++;

            }

            for(; j > startY; j--){
                result[i][j] = count;
                count++;

            }

            for(; i > startX; i--){
                result[i][j] = count;
                count++;
            }


            roundCount++;
            startX++;
            startY++;
            offset++;
        }
        if(n % 2 == 1){
            result[startX][startY] = count;
        }
        return result;
    }
};