Merge pull request #377 from jojoo15/patch-35

优化 1005.K次取反后最大化的数组和 python3版本
2025-07-08 08:50:15 +08:00 · 2021-06-11 15:35:30 +08:00
parent 84a9b8216a 9f3990a78f
commit 700c1bbca2
1 changed files with 1 additions and 1 deletions
--- a/problems/1005.K次取反后最大化的数组和.md
+++ b/problems/1005.K次取反后最大化的数组和.md
@ -133,7 +133,7 @@ class Solution:
                A[i] *= -1
                K -= 1
        if K > 0:
-            A[len(A) - 1] *= ((-1)**K)
+            A[-1] *= (-1)**K #取A最后一个数只需要写-1
        return sum(A)
 ```