LeetCode 977. 有序数组的平方

package Array;

import java.util.Arrays;

/**
 * Created with IntelliJ IDEA.
 * Version : 1.0
 * Author  : cunyu
 * Email   : cunyu1024@foxmail.com
 * Website : https://cunyu1943.github.io
 * Date    : 2020/3/29 11:22
 * Project : LeetCode
 * Package : Array
 * Class   : NineSevenSeven
 * Desc    : 977. 有序数组的平方
 */
public class NineSevenSeven {
	public static void main(String[] args) throws Exception {
		NineSevenSeven nineSevenSeven = new NineSevenSeven();
		int[] A = {-4, -1, 0, , 10};

		for (int item : nineSevenSeven.sortedSquares(A)) {
			System.out.println(item);
		}
	}

	public int[] sortedSquares(int[] A) {
		int[] resultArr = new int[A.length];
		for (int i = 0; i < A.length; i++) {
			resultArr[i] = A[i] * A[i];
		}
		Arrays.sort(resultArr);
		return resultArr;
	}
}