leetcode977

class Solution {
    public  int[] sortedSquares(int[] A) {
        int n = A.length;
        for(int i=0;i<A.length;i++){
            if (A[i]>=0){
                n=i;
                break;
            }
        }
        int i = n-1;
        int j = n;
        int l = 0;
        int[] f =new int[A.length];
        while(i>=0 & j<A.length){
            if (-A[i]<A[j]){
               f[l] = A[i]*A[i];
               i--;
            }else {
                f[l] = A[j]*A[j];
                j++;
            }
            l++;
        }
        while(i>=0){
            f[l] = A[i]*A[i];
            i--;
            l++;
        }
        while(j<A.length){
            f[l] = A[j]*A[j];
            j++;
            l++;
        }
        return f;
    }
}