[릿코드, Leetcode] [JAVA] Squares of a Sorted Array

Squares of a Sorted Array - LeetCode

Leetcode - Squares of a Sorted Array

설명

Given an integer array nums sorted in non-decreasing order, return an array of the squares of each number sorted in non-decreasing order.

Example 1:

Input: nums = [-4,-1,0,3,10]

Output: [0,1,9,16,100]

Explanation: After squaring, the array becomes [16,1,0,9,100]. After sorting, it becomes [0,1,9,16,100].

 

Example 2:

Input: nums = [-7,-3,2,3,11]

Output: [4,9,9,49,121]

제한사항

• nums is sorted in non-decreasing order.

 

소스코드

import java.util.Arrays;

class Solution {
    public int[] sortedSquares(int[] nums) {
        int[] newArr = new int[nums.length];
        
        for (int i=0; i<nums.length; i++) {
            newArr[i] = (int) Math.pow(nums[i], 2);
        }
        Arrays.sort(newArr);
        
        return newArr;
    }
}

제출한 소스코드

lemondkel - Overview