代码随想录DAY2：有序数组的平方 ，长度最小的子数组

有序数组的平方

class Solution {
    public int[] sortedSquares(int[] nums) {

        int len = nums.length;

        int i = 0;
        int j = len - 1;
        int[] result = new int[len];

        for (int k = len - 1; k >= 0; k--) {
            int ii = nums[i] * nums[i];
            int jj = nums[j] * nums[j];

            if (ii < jj) {
                result[k] = jj;
                j--;
            } else if (ii > jj) {
                result[k] = ii;
                i++;
            } else {
                if (i != j) {
                    result[k] = ii;
                    k--;
                    result[k] = jj;
                    i++;
                    j--;
                } else {
                    result[k] = ii;
                }
            }
        }

        return result;
    }
}

长度最小的子数组

class Solution {
    public int minSubArrayLen(int target, int[] nums) {
        int sum = 0;
        int result = Integer.MAX_VALUE;
        int i = 0;
        int subLength = 0;

        for (int j = 0; j < nums.length; j++) {
            sum += nums[j];
            while (sum >= target) {
                subLength = j - i + 1;
                result = result < subLength ? result : subLength;
                sum -= nums[i++];
            }

        }

        return result == Integer.MAX_VALUE ? 0 : result;
    }
}