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

Merge pull request #2384 from smartboy37597/1005doc

Browse Source 
Update max array doc
This commit is contained in:
程序员Carl
2023-12-30 16:58:33 +08:00
committed by GitHub
parent 643048c432 54c3a74618
commit c5a0908906
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

@ -16,7 +16,7 @@
示例 1： 示例 1：
* 输入：A = [4,2,3], K = 1 * 输入：A = [4,2,3], K = 1
* 输出：5 * 输出：5
* 解释：选择索引 (1,) ，然后 A 变为 [4,-2,3]。 * 解释：选择索引 (1) ，然后 A 变为 [4,-2,3]。
示例 2： 示例 2：
* 输入：A = [3,-1,0,2], K = 3 * 输入：A = [3,-1,0,2], K = 3