• 投稿

【数据结构与算法】最简洁易懂的Data Structures入门，MOSH讲解，更新中

2.7万
23
2020-01-04 18:30:08
305
157
1547
97
The Ultimate Data Structures系列，分为三个Part，完整版课程录屏，搬运更新中..……主自用！ 同系列MYSQL搬运完成，地址：av77541375 同系列JAVA搬运完成，地址：av79906814 同系列PYTHON搬运完成，地址：av79789094 建了一个mosh的课交流群，我会把课程相关的所有资料都上传在里面防止百度云失效，群号875485671，也可以私信我(･∀･)
课程
学习
考试
公开课
编程
教程
数据结构
Data Structures
一只不快乐的柠檬精 发消息
咸鱼努力出坑
视频选集
（1/169）
1.1- Course Outline
02:46
2.1- Introduction
00:25
2.2- What is Big O
01:59
2.3- O(1)
01:32
2.4- O(n)
03:45
2.5- O(n^2)
02:27
2.6- O(log n)
02:40
2.7- O(2^n)
00:50
2.8- Space Complexity
02:33
3.1- Introduction
00:45
3.2- Understanding Arrays
03:09
3.3- Working with Arrays in Java
03:32
3.4- Exercise- Array Class
03:23
3.5- Solution- Creating the Class
03:21
3.6- Solution- insert()
04:22
3.7- Solution- removeAt()
04:50
3.8- Solution- indexOf()
02:31
3.9- Dynamic Arrays
03:50
3.10- Summary
01:10
4.1- Introduction
00:37
4.2- What are Linked Lists
04:34
4.3- Working with Linked Lists
03:24
4.4- Exercise- Building a Linked List
01:28
4.5- Solution- addLast
06:11
4.6- Solution- addFirst
02:16
4.7- Solution- indexOf
01:56
4.8- Solution- contains
01:07
4.9- Solution- removeFirst
04:23
4.10- Solution- removeLast
04:42
4.11- Implementing size()
04:15
4.12- Converting Linked Lists to Arrays
02:14
4.13- Cheat Sheets
01:12
4.14- Arrays vs Linked Lists
03:20
4.15- Types of Linked Lists
03:15
4.16- Exercise- Reversing a Linked List
01:38
4.17- Solution- Reversing a Linked List
09:20
4.18- Exercise- Kth Node from the End
03:22
4.19- Solution- Kth Node from the End
05:24
4.20- Summary
01:13
5.1- Introduction
00:32
5.2- What are Stacks
02:46
5.3- Working with Stacks
02:21
5.4- Exercise- Reversing a String
00:42
5.5- Solution - Reversing a String
05:02
5.6- Exercise- Balanced Expressions
02:55
5.7- Solution- A Basic Implementation
05:20
5.8- Solution- Supporting Other Brackets
03:35
5.9- Solution- First Refactoring
04:11
5.10- Solution- Second Refactoring
05:52
5.11- Exercise- Building a Stack Using an Array
00:47
5.12- Solution- Implementing a Stack Using an Array
08:19
5.13- Summary
00:33
6.1- Introduction
00:27
6.2- What are Queues
02:04
6.3- Queues in Java
05:16
6.4- Exercise- Reversing a Queue
01:09
6.5- Solution- Reversing a Queue
02:22
6.6- Exercise- Building a Queue Using an Array
02:05
6.7- Solution- A Basic Implementation
06:36
6.8- Solution- Circular Arrays
05:54
6.9- Exercise- Implementing a Queue Using a Stack
00:56
6.10- Solution- Building a Queue Using a Stack
07:47
6.11- Priority Queues
01:56
6.12- Exercise- Building a Priority Queue
03:58
6.13- Solution- Building a Priority Queue
08:58
6.14- Solution- Refactoring
03:06
6.15- Summary
00:59
7.1- Introduction
00:26
7.2- What are Hash Tables
02:45
7.3- Working with Hash Tables
04:44
7.4- Exercise- Find the First Non-repeated Character
00:55
7.5- Solution- First Non-repeating Character
07:44
7.6- Sets
02:25
7.7- Exercise- First Repeated Character
00:31
7.8- Solution- First Repeated Character
02:42
7.9- Hash Functions
05:57
7.10- Collisions
01:09
7.11- Chaining
01:42
7.12- Open Addressing- Linear Probing
02:41
7.13- Open Addressing- Quadratic Probing
01:30
7.14- Open Addressing- Double Hashing
03:20
7.15- Exercise- Build a HashTable
02:37
7.16- Solution- put()
06:11
7.17- Solution- get()
04:31
7.18- Solution- remove()
02:31
7.19- Solution- Refactoring
11:06
7.20- Summary
01:23
7.21- Course Wrap Up
00:30
1.1- Introduction
00:47
2.1- Introduction
00:52
2.2- What are Trees
05:37
2.4- Exercise- Building a Tree
02:42
2.5- Solution- insert()
07:45
2.6- Solution- find()
02:02
2.7- Traversing Trees
05:59
2.9- Recursion
05:37
2.10- Depth First Traversals
05:25
2.11- Depth and Height of Nodes
07:09
2.12- Minimum Value in a Tree
07:37
2.13- Exercise- Equality Checking
00:46
2.14- Solution- Equality Checking
04:10
2.15- Exercise- Validating Binary Search Trees
04:13
2.16- Solution- Validating Binary Search Trees
04:23
2.17- Exercise- Nodes at K Distance
01:48
2.18- Solution- Nodes at K Distance from the Root
04:39
2.19- Level Order Traversal
02:57
2.21- Summary
01:25
3.1- Introduction
00:29
3.2 Balanced and Unbalanced Trees
03:00
3.3- Rotations
05:04
3.4- AVL Trees
04:11
3.6- Exercise- Building an AVL Tree
01:11
3.7- Solution- insert()
08:50
3.8- Exercise- Height Calculation
01:25
3.9- Solution- Height Calculation
02:56
3.10- Exercise- Balance Factor
02:08
3.11- Solution- Balance Factor
04:10
3.12- Exercise- Detecting Rotations
02:57
3.13- Solution- Detecting Rotations
03:34
3.14- Exercise- Implementing Rotations
03:54
3.15- Solution- Implementing Rotations
05:43
3.17- Summary
01:01
4.1- Introduction
00:27
4.2- What are Heaps
06:31
4.4- Exercise- Building a Heap
01:56
4.5- Solution- insert()
08:29
4.6- Solution- remove()
07:07
4.7- Solution - Edge Cases
06:14
4.8- Heap Sort
02:36
4.9- Priority Queues
05:06
4.10- Exercise- Heapify
01:26
4.11- Solution- Heapify
07:16
4.12- Solution- Optimization
02:44
4.13- Exercise- Kth Largest Item
00:33
4.14- Solution- Kth Largest Item
03:50
4.16- Summary
01:20
5.1- Introduction
00:29
5.2- What are Tries
03:54
5.4- Exercise- Building a Trie
03:06
5.5- Solution- Building a Trie
05:47
5.6- An Implementation with a HashTable
01:52
5.7- A Better Abstraction
05:31
5.8- Exercise- Looking Up a Word
01:13
5.9- Solution- Looking Up a Word
02:42
5.10- Traversals
03:39
5.11- Exercise- Removing a Word
01:55
5.12- Solution- Removing a Word
08:19
5.13- Exercise- Auto Completion
02:54
5.14- Solution- Auto Completion
06:04
5.16- Summary
00:46
6.1- Introduction
00:27
6.2- What are Graphs
02:13
6.3- Adjacency Matrix
04:17
6.4- Adjacency List
06:37
6.5- Exercise- Building a Graph
01:53
6.6- Solution- Adding Nodes and Edges
07:35
6.7- Solution- Removing Nodes and Edges
04:48
6.8- Traversal Algorithms
04:00
6.10- Exercise- Depth-first Traversal (Recursive)
01:30
6.11- Solution- Depth-first Traversal (Recursive)
03:46
6.12- Exercise- Depth-first Traversal (Iterative)
02:48
6.13- Solution- Depth-first Traversal (Iterative)
04:01
6.14- Exercise- Breadth-first Traversal (Iterative)
01:20
6.15- Solution- Breadth-first Traversal
02:45
6.16- Exercise- Topological Sorting
05:17
6.17- Solution- Topological Sort
04:09
6.18- Exercise- Cycle Detection (Directed Graphs)
03:46
6.19- Solution- Cycle Detection (Directed Graphs)
06:30
6.20- Graphs Summary
01:03

【JAVA终极教程】最简洁易懂的入门课程，完整版
一只不快乐的柠檬精
2.3万 117

【最干净易懂的Python终极教程】小白从入门安装到精通完整版，搬运完成！
一只不快乐的柠檬精
4.4万 365

那些离谱数学答案
烟雨剪辑
57.3万 175

【完结】43天搞定408数据结构代码题，手把手每日带练
哈喜老师
14.3万 701

【2026版】B站讲的最好的Coze（扣子）从入门到精通！涵盖coze智能体搭建_coze工作流教程_coze应用开发 ——基础/应用/工作流/搭建智能体！
拉尔夫维古姆
1708 0

【网络爬虫】花了两万多买的Python爬虫教程，包含所有干货内容，小白必看！手把手教学，通俗易懂，全方位讲解Python爬虫知识，让你少走99%的弯路！
喜欢学习的小仙女一枚
4706 30

万献初教授《说文解字》 全96讲
B站知识学院
4.3万 17

【Claude Code】这绝对是b站讲的最好的Claude Code教程，手把手教你在国内从安装到代码实战的保姆级教程！建议收藏学习!让你少走99%弯路！
小张学到地老天荒
3170 61

小小数学题！
司马一小课堂
4.6万 38

08-自动浇水花盆
普中科技
1216 0

麻神理工学霸总结的终极背书法！不看亏大了！3天竟能背完一本书？！无痛高效学习，带你轻松拿下所有知识点
轻舟已过万重山123595
630 0

【2026年】最新油管保姆级，下载安装教程 YouTube
魔芋米浴
5.9万 7

想学PLC，不买设备不报班，只需电脑和AI，半天PLC编程就能入门，后期想深入学PLC，可以让Al制定学习计划，学指令，学项目，零成本学会PLC只是时间问题。
70后陌雪
9463 1

【完整版】这绝对是全B站最用心的C/C++零基础入门全套教程，2026最新版，手把手带你7天搞定C/C++，0基础小白学C/C++看这套就够了！
无敌C加加
2.7万 155

Google Antigravity 2.0 新手指南
未来变量relaunch
1.2万 4

【2026版】这可能是B站唯一将初中语文阅读理解讲明白的课程，现代文语文阅读理解答题技巧题型总结，学完110+不成问题！成功上岸！
窦昕大语文训练场
1.0万 141

【AnythingLLM】本地知识库AnythingLLM安装与配置+接口调用API，超详细教程，零基础小白也能轻松学会
Harness工程
1.6万 83

【全748集】清华大佬终于把Python全套教程讲完了！入门到实战全新讲解，一个月带你小白变大神！（程序员|Python入门零基础|网络爬虫|数据分析）
Python其实很简单
1507 50

【公开课·2026最新版】李飞飞·斯坦福CS231n计算机视觉课程（全18讲）一口把机器学习、深度学习、计算机视觉、神经网络、全给讲透了！
AI从零开始学
4973 59

麻省理工学院—线性代数课（完整版72讲）通俗易懂，堪称线性代数课程天花板！
AI从零开始学
2496 13
展开
参与开学投稿，瓜分万元奖金，赢限量周边
客服
顶部
赛事库 课堂 2021拜年纪