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

Merge pull request #377 from jojoo15/patch-35

Browse Source 
优化 1005.K次取反后最大化的数组和 python3版本
This commit is contained in:
程序员Carl
2021-06-11 15:35:30 +08:00
committed by GitHub
parent 84a9b8216a 9f3990a78f
commit 700c1bbca2
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
problems/1005.K次取反后最大化的数组和.md
View File

@ -133,7 +133,7 @@ class Solution:
A[i] *= -1 A[i] *= -1
K -= 1 K -= 1
if K > 0: if K > 0:
A[len(A) - 1] *= ((-1)**K) A[-1] *= (-1)**K #取A最后一个数只需要写-1
return sum(A) return sum(A)
``` ```