第一章 数组part02 （代码随想录

有序数组的平方

class Solution {
public:
    vector<int> sortedSquares(vector<int>& nums) {
        // vector<int> result;
        vector<int> result(nums.size(), 0);// vector of size nums'size with all values as 0
        int k = nums.size() - 1; //array length
        int right = nums.size() - 1; // right ptr
        int i = 0; // left ptr
        while (i<=right) {
            if (i>right) {
                return result;
            }
            if (nums[i]*nums[i] > nums[right]*nums[right]){
                result[k--] = nums[i]*nums[i];
                i++; // move left ptr
            } else {
                result[k--] = nums[right]*nums[right];
                right--;
            }
        }

        return result;
    }

};

长度最小的子数组

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

螺旋矩阵II

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