CS_learn/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2026-02-02 18:39:09 +08:00
Code Issues Packages Projects Releases Wiki Activity

541~1382连接合并+commit之前 gitpull

Browse Source
This commit is contained in:
XuDaHaoRen
2021-08-24 13:11:57 +08:00
parent 059b5471cd
commit 8c748680f1
37 changed files with 97 additions and 155 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -9,7 +9,7 @@
## 1005.K次取反后最大化的数组和
题目地址：https://leetcode-cn.com/problems/maximize-sum-of-array-after-k-negations/
[力扣题目链接](https://leetcode-cn.com/problems/maximize-sum-of-array-after-k-negations/)
给定一个整数数组 A，我们只能用以下方法修改该数组：我们选择某个索引 i 并将 A[i] 替换为 -A[i]，然后总共重复这个过程 K 次。（我们可以多次选择同一个索引 i。）