代码随想录算法训练营第二天 | 数组和二分查找 (2)

977.有序数组的平方

需要注意两个指针均不能产生IndexOutOfBoundException (类似于合并sorted linked list那题的指针注意事项)

public int[] sortedSquares(int[] nums) {
    int pIdx = 0;
    while(pIdx < nums.length && nums[pIdx] < 0) pIdx++;
    int nIdx = pIdx - 1;
    int[] res = new int[nums.length];
    int idx = 0;
    while(pIdx < nums.length && nIdx >= 0){
        if (nums[nIdx] * nums[nIdx] < nums[pIdx] * nums[pIdx]) 
            res[idx++] = nums[nIdx] * nums[nIdx--];
        else
            res[idx++] = nums[pIdx] * nums[pIdx++];
    }
    while(pIdx < nums.length) res[idx++] = nums[pIdx] * nums[pIdx++];
    while(nIdx >= 0) res[idx++] = nums[nIdx] * nums[nIdx--];
    return res;
}

209.长度最小的子数组

可使用for loop保持右指针的更新，用while loop保持左右指针的最小间距

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

59.螺旋矩阵II

方阵保证可四个方向同时更新相同次数且不越界 -> 指针限定四个方向的界限

public int[][] generateMatrix(int n) {
    int[][] res = new int[n][n];
    int num = 1;
    int top = 0, bottom = n-1, left = 0, right = n-1;
    while (left <= right && top <= bottom){
        for (int i = left; i <= right; i++) res[top][i] = num++;
        top++;
        for (int i = top; i <= bottom; i++) res[i][right] = num++;
        right--;
        for (int i = right; i >= left; i--) res[bottom][i] = num++;
        bottom--;
        for (int i = bottom; i >= top; i--) res[i][left] = num++;
        left++;
    }
    return res;
}