Update 1005.K次取反后最大化的数组和.md

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

@@ -124,7 +124,18 @@ class Solution {
 ```
 
 Python：
-
+```python
+class Solution:
+    def largestSumAfterKNegations(self, A: List[int], K: int) -> int:
+        A = sorted(A, key=abs, reverse=True) # 将A按绝对值从大到小排列
+        for i in range(len(A)):
+            if K > 0 and A[i] < 0:
+                A[i] *= -1
+                K -= 1
+        if K > 0:
+            A[len(A) - 1] *= ((-1)**K)
+        return sum(A)
+```
 
 Go：
 
@@ -135,4 +146,4 @@ Go：
 * 作者微信：[程序员Carl](https://mp.weixin.qq.com/s/b66DFkOp8OOxdZC_xLZxfw)
 * B站视频：[代码随想录](https://space.bilibili.com/525438321)
 * 知识星球：[代码随想录](https://mp.weixin.qq.com/s/QVF6upVMSbgvZy8lHZS3CQ)
-<div align="center"><img src=../pics/公众号.png width=450 alt=> </img></div>
+<div align="center"><img src=../pics/公众号.png width=450 alt=> </img></div>