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

有序数组的平方

class Solution {
    public int[] sortedSquares(int[] nums) {
        int[] copyNums = new int[nums.length];
        int i = 0;
        int j = nums.length - 1;
        for (int k = copyNums.length-1; k >=0; k--) {
            if (Math.pow(nums[i],2) > Math.pow(nums[j],2)) {
                copyNums[k] = (int) Math.pow(nums[i++],2);
            } else {
                copyNums[k] = (int) Math.pow(nums[j--],2);
            }
        }
        return copyNums;
    }
}

长度最小的子数组

class Solution {
    public int minSubArrayLen(int target, int[] nums) {
        int result = Integer.MAX_VALUE;
        int sum =0;
        int left =0;
        for (int right = 0; right < nums.length; right++) {
            sum += nums[right];
            while(sum>=target){
                result = Math.min(result, right - left + 1);
                sum-=nums[left++];
            }
        }
        return result == Integer.MAX_VALUE ? 0 : result;
    }
}