随想录打卡第二天数组02

最新推荐文章于 2024-10-08 14:50:18 发布

诗余浅意

最新推荐文章于 2024-10-08 14:50:18 发布

阅读量358

点赞数 6

文章标签：算法数据结构 java

本文链接：https://blog.csdn.net/qq_43612704/article/details/134724479

版权

力扣977. 有序数组的平方

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

力扣209. 长度最小的子数组

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

力扣59. 螺旋矩阵Ⅱ

class Solution {
    public int[][] generateMatrix(int n) {
        int [][] res = new int[n][n];
        int num = 1;
        int i, j;
        int m = 0;//控制循环轮数
        int start = 0;
        while (m++ < n/2){

            //从左到右
            for(j = start; j < n-m; j++){
                res[start][j] = num++;
            }

            //从上到下
            for(i = start; i < n-m; i++){
                res[i][j] = num++;
            }

            //从右到左
            for(j = n-m; j > start; j--){
                res[i][j] = num++;
            }

            //从下到上
            for(i = n-m; i > start; i--){
                res[i][j] = num++;
            }

            start++;
        }

        if(n%2==1) res[start][start] = num;

        return res;
    }
}