代码随想录第二天

leetcode 977 有序数组的平方

简单数组题

public int[] sortedSquares(int[] nums) {
        int[] arr=new int[nums.length];
        for (int i = 0,j=nums.length-1,pos=nums.length-1; i<=j;) {
        
            arr[pos--]=nums[i]*nums[i]>nums[j]*nums[j]?nums[i]*nums[i++]:nums[j]*nums[j--];
        }
        return arr;
    }

209. 长度最小的子数组

思路是滑动窗口 左出右进 然后进行compare

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

59. 螺旋矩阵 II

哈哈 比之前做的画图题好玩多了
真挺有意思的

public int[][] generateMatrix(int n) {
        int[][] res=new int[n][n];
        int x=1;int count=n-1;
        int right=n-1,down=n-1,left=0,up=0;
        while (x<=n*n){
            for (int i = left; i<=right; i++) {
                res[up][i]=x++;
            }
            up++;
            for (int i = up; i<=down; i++) {
                res[i][right]=x++;
            }
            right--;
            for (int i = right; i>=left; i--) {
                res[down][i]=x++;
            }
            down--;
            for (int i = down; i>=up; i--) {
                res[i][left]=x++;
            }
            left++;

        }return res;