https://github.com/upupming/algorithm
acwing, leetcode, kickstart, 算法模板, PAT 等等
https://github.com/upupming/algorithm
acwing algorithm competitive-programming cpp frontend interview javascript kick-start leetcode pat pseudocode template typescript
Last synced: 24 days ago
JSON representation
acwing, leetcode, kickstart, 算法模板, PAT 等等
- Host: GitHub
- URL: https://github.com/upupming/algorithm
- Owner: upupming
- License: mit
- Created: 2019-10-25T07:41:19.000Z (over 5 years ago)
- Default Branch: master
- Last Pushed: 2024-02-26T05:17:37.000Z (about 1 year ago)
- Last Synced: 2024-02-26T06:27:59.436Z (about 1 year ago)
- Topics: acwing, algorithm, competitive-programming, cpp, frontend, interview, javascript, kick-start, leetcode, pat, pseudocode, template, typescript
- Language: C++
- Homepage: https://upupming.site/tags/algorithm/
- Size: 2.22 MB
- Stars: 264
- Watchers: 6
- Forks: 62
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# algorithm
> Forked from [liuchuo/PAT](https://github.com/liuchuo/PAT).
主要存放训练刷题时的代码,有些有 README,有些源代码里面有注释可以看。
- [AcWing](acwing)
- [算法基础课](acwing/算法基础课)
- [算法竞赛进阶指南](acwing/算法竞赛进阶指南)
- **我的算法模板 [template.md](template.md)**
- TypeScript 算法模板 [template-typescript.md](template-typescript.md)
- [contest.js](https://github.com/harttle/contest.js) —— 用于 TS/JS 的算法模板库
- [algojs](https://github.com/upupming/algojs/)—— 我自己的 TS/JS 的算法模板
- 我的对拍程序 [matcher.cpp](matcher.cpp)
- Google KickStart [kick-start](kick-start)
- LeetCode [leetcode](leetcode)
- [残酷刷题](leetcode/残酷刷题), [主页](http://cruelcoding.com/)
- 想加入残酷刷题群的朋友可以联系我
- [残酷刷题群2021年会](https://www.bilibili.com/video/BV1SL411V7Sd)
- [残酷刷题群2020年会总结](https://zhuanlan.zhihu.com/p/341323903)
- [群规链接](http://board.cruelcoding.com/rules.html)
- lcpredictor: https://lcpredictor.herokuapp.com/
- clist.by: https://clist.by/account/upupming/resource/leetcode.com/
- [校招笔试 2022-online-assessments](2022-online-assessments/README.md)
- 伪代码 [pseudoCode](pseudoCode)
- 其他的都是之前刷 PAT 时候的题目## 关于算法复杂度
在竞赛中,一般算机一秒能运行5 x 10^8次汁算,如果题目給出的时间限制カ1s,那么你选择的算法执行的计算次数最多应该在10^8量级オ有可能解决这个题目。一般 O(n)的算法能解决的数据范围在n < 10^8。
- O(n*logn)的算法能解决的数据范围在n <= 10^6。
- O(n*sqrt(n) )的算法能解决的数据范围在n < 10^5。
- O(n^2)的算法能解决的数据范围在n<5000。
- O(n^3)的算法能解决的数据范围在n <300。
- O(2^n)的算法能解决的数据范围在n < 25。
- O(n!)的算法能解决的数据范围在n < 11。以上范围仅供参考,实际中还要考虑每种算法的常数。
## 推荐一些优质的资源
- [《算法竞赛进阶指南》打卡活动](https://www.acwing.com/activity/content/introduction/6/)
- [《算法竞赛进阶指南》资源社区](https://github.com/lydrainbowcat/tedukuri)
- [yxc的B站](https://space.bilibili.com/7836741/)
- [残酷刷题群排行榜](https://wisdompeak.github.io/lc-score-board/)、[残酷刷题群题目清单](https://docs.google.com/spreadsheets/d/1kBGyRsSdbGDu7DzjQcC-UkZjZERdrP8-_QyVGXHSrB8/edit)、[wisdompeak的B站](https://space.bilibili.com/695330558/)
- [群友YoungForest的博客](https://youngforest.github.io/)
- [灵神的模板库 codeforces-go](https://github.com/EndlessCheng/codeforces-go)
- [群友Bill0412的博客](https://kickstart.best/)
- [OTTFF的B站](https://space.bilibili.com/97228279/)
- [zerotrac的B站](https://space.bilibili.com/3203291/)
- [LeetCode 题目难度分查询](https://zerotrac.github.io/leetcode_problem_rating/)
- https://github.com/lzl124631x/LeetCode
- [lucifer1004的CP笔记](https://cp-wiki.vercel.app/)
- [lucifer1004的B站](https://space.bilibili.com/2403384/)
- [tiger_2005的B站](https://space.bilibili.com/350620554/)
- [Errichto 的 YouTube](https://www.youtube.com/channel/UCBr_Fu6q9iHYQCh13jmpbrg)
- [William Lin 的 YouTube](https://www.youtube.com/channel/UCKuDLsO0Wwef53qdHPjbU2Q)
- [lee215 的 YouTube](https://www.youtube.com/channel/UCUBt1TDQTl1atYsscVoUzoQ)、[lee215 的公众号](https://mp.weixin.qq.com/s/5tcPvmaga1ia31lYqYbNYA)
- [OI WiKi](https://github.com/OI-wiki/OI-wiki)
- [ACM 模板库](https://github.com/F0RE1GNERS/template)
- [Tushar Roy 的 YouTube](https://www.youtube.com/user/tusharroy2525)、[Tushar Roy 的代码库](https://github.com/mission-peace/interview)
- [栗子的 KickStart 题解](https://github.com/lzy960601/Google_Coding_Competitions)
- [Range Minimum Query - TopCoder](https://www.topcoder.com/community/competitive-programming/tutorials/range-minimum-query-and-lowest-common-ancestor/)
- [Pecco 的算法学习笔记](https://www.zhihu.com/column/c_1182444932760125440)## Stargazers over time
[](https://starchart.cc/upupming/algorithm)