[파이썬][Leetcode][릿코드] squares of a sorted array
1. 문제Permalink
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]
Constraints:
1 <= nums.length <= 104-104 <= nums[i] <= 104numsis sorted in non-decreasing order.
Follow up: Squaring each element and sorting the new array is very trivial, could you find an
O(n) solution using a different approach?출처: Leetcode, https://leetcode.com/
2. 해결방법 시간복잡도Permalink
- 단순 코딩 O(Nlog(N))
3. 문제 해결 및 코드Permalink
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| class Solution: | |
| def sortedSquares(self, nums: List[int]) -> List[int]: | |
| for i in range(len(nums)): | |
| nums[i] = nums[i] ** 2 | |
| # 제곱수로 해당 위치 값을 변경해준다. | |
| return sorted(nums) # 정렬된 값을 불러온다. | |
-
주석을 참고하면서 이해를 돕습니다.Permalink
4. 알고리즘 및 해설Permalink
- 반복문을 통해 해당 위치값을 제곱으로 변경해준다.
- 변경된 리스트를 정렬하여 불러온다.