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

update 1005.K次取反后最大化的数组和：添加复杂度分析

Browse Source
This commit is contained in:
Yuhao Ju
2023-04-11 00:34:25 +08:00
committed by GitHub
parent 4afa9c2a51
commit 38c74c90d7
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

@ -85,6 +85,10 @@ public:
};
```
* 时间复杂度: O(nlogn)
* 空间复杂度: O(1)
## 总结
贪心的题目如果简单起来，会让人简单到开始怀疑：本来不就应该这么做么？这也算是算法？我认为这不是贪心？