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 0053.最大子序和：添加复杂度分析

Browse Source
This commit is contained in:
Yuhao Ju
2023-04-11 00:28:09 +08:00
committed by GitHub
parent dbcec85e97
commit 80006ad615
1 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
problems/0053.最大子序和.md
View File

@ -24,8 +24,6 @@
暴力解法的思路，第一层 for 就是设置起始位置，第二层 for 循环遍历数组寻找最大值
- 时间复杂度：O(n^2)
- 空间复杂度：O(1)
```CPP
class Solution {
@ -44,6 +42,9 @@ public:
}
};
```
* 时间复杂度：O(n^2)
* 空间复杂度：O(1)
以上暴力的解法 C++勉强可以过，其他语言就不确定了。
@ -98,7 +99,6 @@ public:
}
};
```
- 时间复杂度：O(n)
- 空间复杂度：O(1)