时间复杂度：是执行当前算法所执行的时间 空间复杂度：是执行当前算法需要占用多少内存空间
常见的时间复杂度量级有：
- 常数阶O(1)
- 对数阶O(logN)
- 线性阶O(n)
- 线性对数阶O(nlogN)
- 平方阶O(n^2)
- 立方阶O(n^3)
- k次方阶O(n^k)
- 指数阶O(2^n)
上面从上到下依次时间复杂度越来越大，执行效率越来越低
常见的空间复杂度量级有
- O(1)
- O(n)
- O(n^2)
-
Notifications
You must be signed in to change notification settings - Fork 0
fezzl/leetcode
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
算法与数据结构
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published