leetcode-patterns-java/LeetCode_Problems/Java/easy/0977. Squares of a Sorted Array.java at main · elchibek5/leetcode-patterns-java · GitHub

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
class Solution {
    public int[] sortedSquares(int[] nums) {
        int A = nums.length - 1;
        int[] answer = new int[nums.length];

        int left = 0;
        int right = A;

        for (int i = A; i >= 0; i --) {
            if (Math.abs(nums[left]) > Math.abs(nums[right])) {
                answer[i] = nums[left] * nums[left];
                left++;
            } else {
                answer[i] = nums[right] * nums[right];
                right--;
            }
        }
        return answer;
    }
}


// class Solution {
//     public int[] sortedSquares(int[] nums) {
//         int[] answer = new int[nums.length];

//         for (int i = 0; i < nums.length; i++) {
//             answer[i] = nums[i] * nums[i];
//         }
//         Arrays.sort(answer);
//         return answer;

//     }
// }