File tree Expand file tree Collapse file tree
Expand file tree Collapse file tree Original file line number Diff line number Diff line change 107107
108108
109109
110+ ## 🌍 SOA 架构
111+
112+ | Project | Version | Article |
113+ | :-------: | :-----: | :----------------------------------------------------------- |
114+ | Zookeeper | 3.5.6 | [ 从Paxos到ZooKeeper——Hello ZK] ( /docs/soa/zookeeper/Hello-Zookeeper.md ) <br />[ ZooKeeper实战——Curator] ( /docs/soa/zookeeper/Zookeeper实战与源码.md ) <br /> |
115+
116+
117+
110118## 👨🏿💻 Big Data
111119
112120| Project | Version | Article |
117125
118126## 🔢 算法 - Algorithms
119127
120- | Project | Article |
121- | :------: | :------------------------------------------ |
122- | LeetCode | [ 两数之和 ] ( /docs/leetcode/两数之和 .md ) <br /> |
128+ | Project | Article |
129+ | :------: | :----------------------------------------------------------- |
130+ | LeetCode | [ 时间复杂度详解 ] ( /docs/leetcode/complexity .md ) <br />[ 两数之和 ] ( /docs/leetcode/两数之和.md ) |
123131
124132
125133
Original file line number Diff line number Diff line change 11> 高级工程师title的我,最近琢磨着好好刷刷算法题更高级一些,然鹅,当我准备回忆大学和面试时候学的数据结构之时,我发现自己对这个算法复杂度的记忆只有OOOOOooo
2+ >
3+ > 文章收录在 GitHub [ JavaKeeper] ( https://github.com/Jstarfish/JavaKeeper ) ,N线互联网开发必备技能兵器谱
24
35算法(Algorithm)是指用来操作数据、解决程序问题的一组方法。对于同一个问题,使用不同的算法,也许最终得到的结果是一样的,但在过程中消耗的资源和时间却会有很大的区别。
46
@@ -189,9 +191,11 @@ for(i=1; i<=n; ++i)
189191
190192
191193
192- 参考:
194+ ## 参考
195+
193196《大话数据结构》
194197https://zhuanlan.zhihu.com/p/50479555
195198
196199
197200
201+ ![ ] ( https://tva1.sinaimg.cn/large/00831rSTly1gd73fpmmbwj30ku0aumy2.jpg )
You can’t perform that action at this time.
0 commit comments