algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-09 19:44:45 +08:00
Code Issues Packages Projects Releases Wiki Activity

0977. 有序数组的平方

Browse Source 
添加Java注释
This commit is contained in:
AronJudge
2022-06-26 23:50:32 +08:00
parent e8d1a1a36b
commit ffe981fb6c
1 changed files with 1 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

1
problems/0977.有序数组的平方.md
View File

@ -106,6 +106,7 @@ class Solution {
int index = result.length - 1; int index = result.length - 1;
while (left <= right) { while (left <= right) {
if (nums[left] * nums[left] > nums[right] * nums[right]) { if (nums[left] * nums[left] > nums[right] * nums[right]) {
// 正数的相对位置是不变的， 需要调整的是负数平方后的相对位置
result[index--] = nums[left] * nums[left]; result[index--] = nums[left] * nums[left];
++left; ++left;
} else { } else {