leetcode-solutions/solutions/977. Squares of a Sorted Array.java at master · tarunthota3/leetcode-solutions · 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

class Solution {

public int[] sortedSquares(int[] A) {

int i=0;

int j=A.length-1;

int k=A.length-1;

int[] ans=new int[A.length];

while(i<=j){

int val1=Math.abs(A[i]);

int val2=Math.abs(A[j]);

if(val2>val1){

val2=val2*val2;

ans[k]=val2;

k--;

j--;

}else{

val1=val1*val1;

ans[k]=val1;

k--;

i++;

}

}

return ans;

}

}