Commit 722a32c

authored

Update 0977.有序数组的平方.md

python3 version of brutal force

1 parent 87abfa1 commit 722a32cCopy full SHA for 722a32c

File tree

-0

lines changed

-0

lines changed

Lines changed: 9 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -39,6 +39,15 @@ public:`
`39`	`39`	`}`
`40`	`40`	`};`
`41`	`41`	```
	`42`	+```python3
	`43`	`+class Solution:`
	`44`	`+ def sortedSquares(self, nums: List[int]) -> List[int]:`
	`45`	`+ res=[]`
	`46`	`+ for num in nums:`
	`47`	`+ res.append(num**2)`
	`48`	`+ return sorted(res)`
	`49`	+```
	`50`	`+`
`42`	`51`
`43`	`52`	`这个时间复杂度是 O(n + nlogn), 可以说是O(nlogn)的时间复杂度,但为了和下面双指针法算法时间复杂度有鲜明对比,我记为 O(n + nlog n)。`
`44`	`53`

Comments

(0)