977. Squares of a Sorted Array -with java- (leetcode.com)

Solution.java

/*
Your runtime beats 100.00 % of java submissions.
Your memory usage beats 66.62 % of java submissions.
*/

class Solution {
    public int abs(int a){
        if(a >= 0){return a;}
        return -a;
    }
    public int max(int a, int b){
        if(a>=b){
            return a;
        }
        return b;
    }
    public int[] sortedSquares(int[] A) {
        int[] returnedArray = new int[A.length];
        int right = A.length-1;
        int left = 0;
        for(int i=0 ; i < A.length ; i++){
            if(abs(A[left])<abs(A[right])){
                returnedArray[A.length-i-1] = A[right]*A[right];
                right--;
            }else{
                returnedArray[A.length-i-1] = A[left]*A[left];
                left++;
            }
        }
        return returnedArray;
    }
}