mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-09 19:44:45 +08:00
添加0977.有序数组的平方 Kotlin版本
This commit is contained in:
@ -359,7 +359,28 @@ class Solution {
|
|||||||
}
|
}
|
||||||
```
|
```
|
||||||
|
|
||||||
|
Kotlin:
|
||||||
|
```kotlin
|
||||||
|
class Solution {
|
||||||
|
// 双指针法
|
||||||
|
fun sortedSquares(nums: IntArray): IntArray {
|
||||||
|
var res = IntArray(nums.size)
|
||||||
|
var left = 0 // 指向数组的最左端
|
||||||
|
var right = nums.size - 1 // 指向数组端最右端
|
||||||
|
// 选择平方数更大的那一个往 res 数组中倒序填充
|
||||||
|
for (index in nums.size - 1 downTo 0) {
|
||||||
|
if (nums[left] * nums[left] > nums[right] * nums[right]) {
|
||||||
|
res[index] = nums[left] * nums[left]
|
||||||
|
left++
|
||||||
|
} else {
|
||||||
|
res[index] = nums[right] * nums[right]
|
||||||
|
right--
|
||||||
|
}
|
||||||
|
}
|
||||||
|
return res
|
||||||
|
}
|
||||||
|
}
|
||||||
|
```
|
||||||
|
|
||||||
-----------------------
|
-----------------------
|
||||||
<div align="center"><img src=https://code-thinking.cdn.bcebos.com/pics/01二维码一.jpg width=500> </img></div>
|
<div align="center"><img src=https://code-thinking.cdn.bcebos.com/pics/01二维码一.jpg width=500> </img></div>
|
||||||
|
Reference in New Issue
Block a user