class Solution {
public int[] sortedSquares(int[] nums) {
for(int i = 0; i < nums.length; i++) {
nums[i]*= nums[i];
}
Arrays.sort(nums);
return nums;
}
}
'JAVA > leetcode' 카테고리의 다른 글
[LeetCode] Array - Remove Element !! (0) | 2021.08.05 |
---|---|
[LeetCode] Array - Merge Sorted Array (0) | 2021.08.05 |
[LeetCode] Array - Duplicate Zeros !! (0) | 2021.08.05 |
[LeetCode] Array - Find Numbers with Even Number of Digits (0) | 2021.08.04 |
[LeetCode] Array - Max Consecutive Ones (0) | 2021.08.04 |