代码随想录算法训练营day2

力扣977

    public int[] sortedSquares(int[] nums) {
        int[] result = new int[nums.length];
        int left = 0;
        int right = nums.length - 1;
        int index = nums.length - 1;
        while (left <= right) {
            if (nums[left] * nums[left] > nums[right] * nums[right]) {
                result[index] = nums[left] * nums[left];
                left ++;
            } else {
                result[index] = nums[right] * nums[right];
                right --;
            }
            index --;
        }
        return result;
    }

长度最小的子数组

  public static int minSubArrayLen(int target, int[] nums) {
        int sum = 0;
        int minLength = Integer.MAX_VALUE;
        int slow = 0;
        for (int i = 0; i < nums.length; i++) {
            sum += nums[i];
            while (sum >= target) {
                minLength = Math.min(minLength, i - slow + 1);
                sum -= nums[slow];
                slow ++;
            }
        }
        return minLength == Integer.MAX_VALUE ? 0 : minLength;
    }

螺旋矩阵

    public static int[][] generateMatrix(int n) {
        int[][] result = new int[n][n];
        int loop = 0;
        int start = 0;
        int count = 1;
        int i, j;
        while (loop ++ < n / 2) {
            for (j = start; j < n - loop; j ++) {
                result[start][j] = count ++;
            }

            for (i = start; i < n - loop; i++) {
                result[i][j] = count ++;
            }

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

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

        if (n % 2 == 1) {
            result[start][start] = count;
        }

        return result;

    }