-
Notifications
You must be signed in to change notification settings - Fork 0
/
march_02_24.java
60 lines (43 loc) · 1.31 KB
/
march_02_24.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
53
54
55
56
57
58
59
60
/*Squares of a Sorted Array
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.
Follow up: Squaring each element and sorting the new array is very trivial, could you find an O(n) solution using a different approach?
*/
public class march_02_24{
public static void main(String args[]){
int nums[] = {-4,0,2,4,5};
int ans[] = sortedSquares(nums);
for (int i = 0; i < ans.length; i++) {
System.out.println(ans[i]);
}
}
public static 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){
if(Math.abs(nums[left]) < Math.abs(nums[right])){
ans[i] = nums[right]*nums[right];
right--;
i--;
}
else{
ans[i] = nums[left]*nums[left];
left++;
i--;
}
}
return ans;
}
}