-
Notifications
You must be signed in to change notification settings - Fork 2
/
SquaresOfSortedArray.java
52 lines (47 loc) · 1.32 KB
/
SquaresOfSortedArray.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
package Leetcode;
/**
* @author kalpak
* 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] <= 104
* nums is sorted in non-decreasing order.
*/
public class SquaresOfSortedArray {
public static int[] sortedSquares(int[] nums) {
int[] result = new int[nums.length];
int left = 0;
int right = nums.length - 1;
for(int i = nums.length - 1; i >= 0; i--) {
if(Math.abs(nums[left]) > Math.abs(nums[right])) {
result[i] = nums[left] * nums[left];
left++;
} else {
result[i] = nums[right] * nums[right];
right--;
}
}
return result;
}
public static void main(String[] args) {
int[] nums = new int[]{-4,-1,0,3,10};
int[] result = sortedSquares(nums);
for(int i : result)
System.out.print(i + " ");
System.out.println();
}
}