leetcode practice

day2:

977 Squares of a Sorted Array:

class Solution {
public:
    vector<int> sortedSquares(vector<int>& nums) {
        int size = nums.size();
        vector<int> result(size, 0);
        int i = 0;
        int j = size-1;
        for (int x = size-1; x >= 0; x--){
            if(nums[i] * nums[i] > nums[j] * nums[j]){
                result[x] = nums[i] * nums[i];
                i++;
            }
            else{
                result[x] = nums[j] * nums[j];
                j--;
            }
        }
        return result;
    }
};

209 Minimum Size Subarray Sum:

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

59  Spiral Matrix II: