你们刷 leetcode 前会把算法书过一遍吗？

搬砖
21

刚开始刷题 请问下DSA是什么？

22

data structures and algorithms

23

找了一圈没有找到这个系列视频，大神可以贴个链接吗？还是这些是收费视频，只有donate用户能看到？ 谢谢

24

我猜是这个系列

2 个赞
25

算法导论
zs

26

b站搜灵茶山艾府

3 个赞
27

楼下放b站链接了

28

感谢感谢:folded_hands:

29

吃力就看算法思想录呗 没办法保证每天坚持学就报个他那个课逼着自己坚持
我最近参加了个这个的课https://leetcode-solution.cn/ 感觉还不错91天就当复习练练手了 30人刀要啥自行车 还有人解答讨论一下 当然资料都是开源的 不报名摆在那照样能看

30

系统入门学习算法我也想推荐这门课，在 Coursera 上还有 grader，不过 leetcode 和面试一般也遇不上这么难的。比较好玩的是上完课会手写 Left-leaning Red-Black Tree (LLRB)、快排（包括 quick select）和KMP。

Also known as algs4 and Princeton COS 226, Algorithms on Coursera is an introductory course to fundamental data types, algorithms, and data structures, divided into two Parts.

  • Part I focuses on elementary data structures, sorting, and searching. Topics include union−find, binary search, stacks, queues, bags, insertion sort, selection sort, shellsort, quicksort, 3-way quicksort, mergesort, heapsort, binary heaps, binary search trees, red−black trees, separate-chaining and linear-probing hash tables, Graham scan, and kd-trees.
  • Part II focuses on graph and string-processing algorithms. Topics include depth-first search, breadth-first search, topological sort, Kosaraju−Sharir, Kruskal, Prim, Dijkistra, Bellman−Ford, Ford−Fulkerson, LSD radix sort, MSD radix sort, 3-way radix quicksort, multiway tries, ternary search tries, Knuth−Morris−Pratt, Boyer−Moore, Rabin–Karp, regular expression matching, run-length coding, Huffman coding, LZW compression and Burrows−Wheeler transform. Part II also introduces reductions and intractability, including the P = NP problem.
1 个赞
31

现在还能报名吗？

32

效率太低了。遇到不懂的学就行了。

33

op是第一次刷还是复习？

我个人的策略是分类刷，对于每一类的题准备一个模板。

当然我是loser 面Google算法轮全挂

34

你指哪个
代码随想录上一个是8.6的营 应该8.20会开下一期
91那个估计还得俩月之后才能有下一期