Wnxy's Blog HomeArchivesTagsCategoriesMessageLinksAboutInterestClover
LeetCode时间复杂度估计
|
Word count: 42|Reading time: 1 min

我要刷题，刷LeetCode使我快乐！！！

时间复杂度 1s内可处理的n的规模
O(n) 5*10^8
O(n*logn) 2*10^7
O(n^2) 2.25*10^4
Author: wnxy
Link: https://wnxy.xyz/2022/05/10/leetcode_time_complexity_estimation/
Copyright Notice: All articles in this blog are licensed under CC BY-NC-SA 4.0 unless stating additionally.
注：本站配置Disqus和Valine双评论系统，可选其中之一使用！🧐🧐🧐