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

docs:k次取反添加视频链接

Browse Source
This commit is contained in:
liangzhensheng
2023-03-17 11:22:58 +08:00
parent 6f8d5eb7a0
commit a8d3d3cf75
1 changed files with 4 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -34,6 +34,10 @@
* 1 <= K <= 10000
* -100 <= A[i] <= 100
# 视频讲解
**《代码随想录》算法视频公开课：[贪心算法，这不就是常识？还能叫贪心？LeetCode：1005.K次取反后最大化的数组和](https://www.bilibili.com/video/BV138411G7LY)，相信结合视频在看本篇题解，更有助于大家对本题的理解**。
## 思路
本题思路其实比较好想了，如何可以让数组和最大呢？