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

update 0279.完全平方数：添加复杂度分析

Browse Source
This commit is contained in:
Yuhao Ju
2023-04-11 11:57:47 +08:00
committed by GitHub
parent 9fef5cbd00
commit b6fcdc160d
1 changed files with 6 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
problems/0279.完全平方数.md
View File

@ -127,6 +127,10 @@ public:
}; };
``` ```
* 时间复杂度: O(n * √n)
* 空间复杂度: O(n)
同样我在给出先遍历物品，在遍历背包的代码，一样的可以AC的。 同样我在给出先遍历物品，在遍历背包的代码，一样的可以AC的。
```CPP ```CPP
@ -145,6 +149,8 @@ public:
} }
}; };
``` ```
* 同上
## 总结 ## 总结