人工精选【慕课】玩转算法面试-- Leetcode真题分门别类讲解 - 带源码课件
如果你正在准备跳槽,技术面里最没底的就是算法环节——不是完全不会,而是不知道面试官会怎么问、自己该往哪个方向准备。这门课解决的就是这个具体问题:把 LeetCode 上的高频题按类型拆开讲,而不是从第一题顺序刷到最后一题。 它针对的是哪个工作场景 面试里的算法题有个特点:现场写、有时间压力、面试官还
会员可免费下载本篇月会员可按日额度下载(每篇扣 1 次)。
开通会员 ›会员 A · 按档位折扣
游客按标价购买,不享受上表折扣。
支付成功后自动发放网盘链接,链接失效可找客服免费补
如果你正在准备跳槽,技术面里最没底的就是算法环节——不是完全不会,而是不知道面试官会怎么问、自己该往哪个方向准备。这门课解决的就是这个具体问题:把 LeetCode 上的高频题按类型拆开讲,而不是从第一题顺序刷到最后一题。
它针对的是哪个工作场景
面试里的算法题有个特点:现场写、有时间压力、面试官还要看你的思路表达。很多人平时刷题能过,一到白板或者共享文档前就卡壳,因为练的是"写出来",不是"讲出来"。这门课在讲每类题的时候,会先带着梳理这类问题的识别特征和常见解法,再落到具体代码。它更适合已经有一点编程基础、但刷题没有章法的人,而不是零基础学编程的入门者。
按题型分类,而不是按题号顺序
LeetCode 现在题目数量很大,按题号刷基本等于碰运气。这门课的做法是先归类,同一类问题集中处理,比如数组与双指针、链表操作、二叉树遍历与递归、动态规划、回溯、贪心等常见面试题型。同一类题放在一起讲,好处是你能看出解法之间的复用关系——下次遇到新题,先判断它属于哪一类,而不是从零想。
这对面试的实际意义是:面试官给出一道你没见过的题时,你能快速归类、说出思路方向,即使最后没写完整,表达分也拿到了。
学完能独立做什么
- 拿到一道中等难度的题,能判断它属于哪一类问题,并说出至少一种可行思路;
- 能独立写出常见数据结构(数组、链表、栈、队列、哈希表、二叉树)上的基本操作题;
- 对动态规划、回溯这类容易卡住的题型,知道从哪里下手、状态怎么定义;
- 能在面试场景下边写边讲,而不是闷头写完再说。
需要说清楚的是:这门课不负责帮你刷完几百道题,也不保证你看完就能拿到 offer。它给的是分类框架和解题思路,剩下的练习量还得自己补。如果你指望"看完就会",这门课不适合你。
资料适合什么基础
配套的源码课件按题型分好,适合边看边对照。但前提是你至少熟悉一门编程语言的基本语法,能看懂循环、递归、类和对象这些概念。如果连基础的数组和字符串操作都还不熟,建议先把语言基础过一遍再来,否则会跟不上讲解节奏。
另外,源码可以当参考,但不建议直接抄。更有效的用法是:先自己写,卡住了再看课件里的实现,对比思路差在哪。课件里也会有部分题目的多种解法,适合用来扩展思路,而不是背答案。
怎么安排学习节奏
如果每天能拿出一个到一个半小时,建议按题型推进,一次只攻一类,不要东看一道西看一道。每类题看完讲解后,自己找两三道同类题练手,确认能独立写出来再进入下一类。动态规划和回溯这两块通常会慢一些,可以留出更多时间。
准备周期在两到三个月的,可以把这门课当成主线框架;时间更紧的,优先挑你目标岗位面试里出现频率高的题型看。这门课的价值在于帮你把散乱的刷题变成有结构地准备,而不是替代练习本身。
课程目录
课程目录73 集
- 【慕课】玩转算法面试-- Leetcode真题分门别类讲解 - 带源码课件 Leetcode?????????? ?????? ??????Leetcode?????????????????????????????????????????????????????????????????????? ? ????? ???????????Leetcode?????????????????????? ?��????? ? Leetcode??????? ? ????????��?? ? ??????????? �γ�Ŀ¼ ? ??11?? ??????? ??11?? ??????????.png [493.5 KB] 11-1 ????.mp4
- [6.1 MB] !????????????.bat [967.0 B] ? ??6?? ???????????????? ??6?? ???????????????????.zip
- [1.8 MB] 6-7 ????????????????? Top K Freqvuent Elements.mp4
- [67.0 MB] 6-3 ??????????.mp4
- [86.8 MB] 6-6 ???????.mp4
- [70.6 MB] 6-5 BFS???????????? Perfect Squares.mp4
- [119.5 MB] 6-4 ???????????? Binary Tree Leel Order Traersal.mp4
- [54.7 MB] 6-1 ????????? alid Parentheses.mp4
- [84.7 MB] 6-2 ??????????? Binary Tree Preorder, Inorder and Postorder Traersal.mp4
- [77.7 MB] ? ??4?? ???????????? ??4?? ??????????????.png [493.5 KB] 4-2 map????? Intersection of Two Arrays II.mp4
- [57.2 MB] 4-3 set??map??????????????.mp4
- [91.0 MB] 4-7 ?????????????? Contain Duplicate II.mp4
- [60.0 MB] 4-1 set????? Intersection of Two Arrays.mp4
- [68.9 MB] 4-5 ???????? 4Sum II.mp4
- [63.9 MB] 4-4 ????????????????? Two Sum.mp4
- [81.8 MB] 4-8 ?????????????????????? Contain Duplicate III.mp4
- [55.3 MB] 4-6 ???????? Number of Boomerangs.mp4
- [64.1 MB] ? ??3?? ??????????????????? ??3?? ???????????????????????.png [493.5 KB] 3-1 ??????????????????????????.mp4
- [93.6 MB] 3-4 ????????????????????????.mp4
- [68.2 MB] 3-5 ????????partition???????? Sort Color.mp4
- [96.0 MB] 3-2 ?????????????????????????????.mp4
- [44.9 MB] 3-7 ???????? Minimum Size Subarray Sum.mp4
- [65.7 MB] 3-6 ?????? Two Sum II - Input Array is Sorted.mp4
- [86.0 MB] 3-8 ???????????????? Longest Substring Without Repeating Characters.mp4
- [67.2 MB] 3-3 ??LeetCode????????????? Moe Zeros.mp4
- [58.7 MB] ? ??9?? ?????????? ??9?? ??????????????.zip
- [1.8 MB] 9-1 ?????????.mp4
- [89.7 MB] 9-2 ??????????????? Climbing Stairs.mp4
- [61.3 MB] 9-3 ????????????? Integer Break.mp4
- [119.8 MB] 9-6 0-1?????????????????.mp4
- [85.0 MB] 9-8 LIS???? Longest Increasing Subseqvuence.mp4
- [111.0 MB] 9-4 ????????????? House Robber.mp4
- [116.0 MB] 9-9 LCS????????????????????????????.mp4
- [89.0 MB] 9-7 ????????0-1???????? Partition Equal Subset Sum.mp4
- [119.3 MB] 9-5 0-1????????.mp4
- [162.9 MB] ? ??8?? ???????? ??8?? ????????????.zip
- [1.8 MB] 8-6 ????????????? Word Search.mp4
- [114.9 MB] 8-3 ???????? Permutations.mp4
- [104.8 MB] 8-1 ???????? Letter Combinations of a Phone Number.mp4
- [90.1 MB] 8-7 floodfill????????????? Number of Islands-.mp4
- [105.0 MB] 8-4 ??????? Combinations.mp4
- [83.5 MB] 8-5 ???????????????????.mp4
- [76.5 MB] 8-2 ???????.mp4
- [71.2 MB] 8-8 ????????????????????? N Qvueens.mp4
- [112.0 MB] ? ??5?? ???????????????? ??5?? ??????????????????.zip
- [1.8 MB] 5-6 ?????????? Remoe Nth Node Form End of List.mp4
- [80.6 MB] 5-4 ???????????? Swap Nodes in Pairs.mp4
- [58.0 MB] 5-1 ????????????????? Reerse Linked List.mp4
- [75.0 MB] 5-3 ?????????????????? Remoe Linked List Elements.mp4
- [82.6 MB] 5-2 ???????????????.mp4
- [67.8 MB] 5-5 ??????????????? Delete Node in a Linked List.mp4
- [41.1 MB] ? ??7?? ?????????? 7-4 ?????????? Binary Tree Path.mp4
- [71.1 MB] 7-6 ?????????????????? Lowest Common Ancestor of a Binary Search Tree.mp4
- [77.6 MB] 7-1 ??????????????.mp4
- [82.9 MB] 7-3 ????????????? Path Sum.mp4
- [58.9 MB] 7-2 ???????????????????????? Inert Binary Tree.mp4
- [45.3 MB] 7-5 ??????????? Path Sum III.mp4
- [72.5 MB] ? ??10?? ????? 10-3 ??????????????.mp4
- [65.1 MB] 10-2 ??????????????? Non-oerlapping Interals.mp4
- [94.0 MB] 10-1 ?????? Assign Cookies.mp4
- [55.6 MB] ? ??1?? ??????????????? 1-3 ????????????.mp4
- [66.5 MB] 1-2 ???????????????????.mp4
- [65.6 MB] 1-1 ????????????????????????.mp4
- [87.4 MB] 1-4 ????????????????.mp4
- [57.5 MB] ? ??2?? ??????????????? 2-3 ??????????.mp4
- [76.9 MB] 2-7 ??????????.mp4
- [47.8 MB] 2-6 ???????????????Amortized Time Analysis??.mp4
- [73.8 MB] 2-2 ?????????????????.mp4
- [47.4 MB] 2-5 ??????????????.mp4
- [64.9 MB] 2-4 ??????????????????????.mp4
- [79.7 MB] 2-1 ?????????O??Big O??.mp4
- [92.7 MB] coding-82.zip
- [23.3 MB] ?????? ???????? ???????? ?????? ѧϰ�ջ� ????Leetcode??????? ?????????????? ???????????? ???????? ????????????????





