Squares of a Sorted Array (E)
題目
Given an integer array nums sorted in non-decreasing order, return an array of the squares of each number sorted in non-decreasing order.
Example 1:
Input: nums = [-4,-1,0,3,10]
Output: [0,1,9,16,100]
Explanation: After squaring, the array becomes [16,1,0,9,100].
After sorting, it becomes [0,1,9,16,100].
Example 2:
Input: nums = [-7,-3,2,3,11]
Output: [4,9,9,49,121]
Constraints:
1 <= nums.length <= 104-104 <= nums[i] <= 104numsis sorted in non-decreasing order.
題意
將遞增陣列內的數字取平方后再按照大小進行排序，
思路
因為原陣列是遞增的，所以最大的平方數一定出現在兩邊，直接用雙指標指向兩端，用類似歸并排序的方法將平方數按照從大到小的順序插入到結果陣列中，
代碼實作
Java
class Solution {
public int[] sortedSquares(int[] nums) {
int[] ans = new int[nums.length];
int i = nums.length - 1;
int left = 0, right = nums.length - 1;
while (left <= right) {
int leftSquare = nums[left] * nums[left];
int rightSquare = nums[right] * nums[right];
if (leftSquare >= rightSquare) {
ans[i--] = leftSquare;
left++;
} else {
ans[i--] = rightSquare;
right--;
}
}
return ans;
}
}
轉載請註明出處，本文鏈接：https://www.uj5u.com/qita/235327.html
標籤：其他
上一篇：不復雜的空間復雜度