mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-08 08:50:15 +08:00
@ -181,6 +181,17 @@ class Solution:
|
||||
### Go:
|
||||
|
||||
```Go
|
||||
// 排序法
|
||||
func sortedSquares(nums []int) []int {
|
||||
for i, val := range nums {
|
||||
nums[i] *= val
|
||||
}
|
||||
sort.Ints(nums)
|
||||
return nums
|
||||
}
|
||||
```
|
||||
```Go
|
||||
// 双指针法
|
||||
func sortedSquares(nums []int) []int {
|
||||
n := len(nums)
|
||||
i, j, k := 0, n-1, n-1
|
||||
|
Reference in New Issue
Block a user