René's URL Explorer Experiment


Title: 面试必刷Top101 | 凡是过往、皆为序章

Open Graph Title: 面试必刷Top101

Description: 面试必刷Top101 算法题 链表 二分查找/排序 17.二分查找-I 【简单】 18.二维数组中的查找 【中等】 19.寻找峰值 【中等】 20.数组中的逆序对 【中等】 21.旋转数组的最小数字 【简单】 22.比较版本号 【中等】 二叉树 23.二叉树的前序遍历 【简单】 24.二叉树的中序遍历 【中等】 25.二叉树的后序遍历 【简单】 26....

Open Graph Description: 面试必刷Top101 算法题 链表 二分查找/排序 17.二分查找-I 【简单】 18.二维数组中的查找 【中等】 19.寻找峰值 【中等】 20.数组中的逆序对 【中等】 21.旋转数组的最小数字 【简单】 22.比较版本号 【中等】 二叉树 23.二叉树的前序遍历 【简单】 24.二叉树的中序遍历 【中等】 25.二叉树的后序遍历 【简单】 26....

Opengraph URL: https://142vip.cn/JavaScriptCollection/solo-algorithm/interview-101/

Generator: VuePress 2.0.0-rc.22

direct link

Domain: 142vip.github.io


Hey, it has json ld scripts:
{"@context":"https://schema.org","@type":"Article","headline":"面试必刷Top101","image":[""],"dateModified":"2024-09-24T03:44:26.000Z","author":[{"@type":"Person","name":"微信公众号:储凡","email":"fairy_vip@2925.com","url":"https://github.com/142vip","homePage":"https://142vip.cn","github":"https://gitee.com/mmdapl","githubVip":"https://gitee.com/chufan443","gitee":"https://gitee.com/chufan443"}]}

themeVuePress Theme Hope 2.0.0-rc.87
og:site_name凡是过往、皆为序章
og:typearticle
og:localezh-CN
og:updated_time2024-09-24T03:44:26.000Z
article:modified_time2024-09-24T03:44:26.000Z
datePublished2023-03-15T01:45:24.000Z
timeRequiredPT12M

Links:

跳至主要內容https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/#main-content
凡是过往、皆为序章https://142vip.github.io/JavaScriptCollection/
🔥 首页https://142vip.github.io/JavaScriptCollection/
❓ 面试必刷Top101https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
⚔️ 剑指Offerhttps://142vip.github.io/JavaScriptCollection/solo-algorithm/sword-point.html
🌟 Shell篇https://142vip.github.io/JavaScriptCollection/solo-algorithm/shell/
🫀 牛客https://www.nowcoder.com/
🪐 力扣https://leetcode-cn.com/
🏫 杭电OJhttps://acm.hdu.edu.cn/
💡 Battle面试官https://142vip.github.io/JavaScriptCollection/battle-interview/
👩🏻‍💻 前端https://142vip.github.io/JavaScriptCollection/front-end/
👨🏻‍💻 后端https://142vip.github.io/JavaScriptCollection/server-end/
💫 开发技巧https://142vip.github.io/JavaScriptCollection/develop-skill/
🕸️ 微服务架构https://142vip.github.io/JavaScriptCollection/microservice/
📖 读书整理https://142vip.github.io/JavaScriptCollection/read-books/
📄 变更记录https://142vip.github.io/JavaScriptCollection/changelog.html
📣 网站动态https://142vip.github.io/JavaScriptCollection/big-event-history.html
🎉 历史版本https://github.com/142vip/JavaScriptCollection/releases
🎯 开发计划https://142vip-cn.feishu.cn/share/base/view/shrcnuuRDWBoHLmYaknXWFuhR4d
🔗 技术&平台https://142vip.github.io/JavaScriptCollection/frequent-site-link.html
💥 公众号文章https://142vip.github.io/JavaScriptCollection/wechat-list.html
https://github.com/142vip/JavaScriptCollection
❓ 面试必刷Top101https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
⚔️ 剑指Offerhttps://142vip.github.io/JavaScriptCollection/solo-algorithm/sword-point.html
🌟 Shell篇https://142vip.github.io/JavaScriptCollection/solo-algorithm/shell/
🫀 牛客https://www.nowcoder.com/
🪐 力扣https://leetcode-cn.com/
🏫 杭电OJhttps://acm.hdu.edu.cn/
微信公众号:储凡https://github.com/142vip
面试必刷Top101https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/#面试必刷top101
算法题https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/#算法题
链表https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/#链表
1.反转链表【简单】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/reverseList.html
2.链表内指定区间反转 【中等】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/reverseBetween.html
3.链表中的节点每k个一组翻转 【中等】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/reverseGroup.html
4.合并两个排序的链表 【简单】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/merge.html
5.合并k个已排序的链表 【较难】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/mergeList.html
6.判断链表中是否有环 【简单】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/hasCycle.html
7.链表中环的入口结点 【中等】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/entryNodeOfLoop.html
8.链表中倒数最后k个结点 【简单】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/findKthToTail.html
9.删除链表的倒数第n个节点 【中等】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/removeNthFromEnd.html
10.两个链表的第一个公共结点 【简单】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/findFirstCommonNode.html
11.链表相加(二) 【中等】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/addList.html
12.单链表的排序 【中等】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/sortInList.html
13.判断一个链表是否为回文结构 【简单】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/isPail.html
14.链表的奇偶重排 【中等】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/oddEventList.html
15.删除有序链表中重复的元素-I 【简单】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/deleteDuplicates-one.html
16.删除有序链表中重复的元素-II 【中等】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/deleteDuplicates-two.html
二分查找/排序https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/#二分查找-排序
17.二分查找-I 【简单】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
18.二维数组中的查找 【中等】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
19.寻找峰值 【中等】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
20.数组中的逆序对 【中等】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
21.旋转数组的最小数字 【简单】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
22.比较版本号 【中等】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
二叉树https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/#二叉树
23.二叉树的前序遍历 【简单】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
24.二叉树的中序遍历 【中等】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
25.二叉树的后序遍历 【简单】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
26.求二叉树的层序遍历 【中等】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
27.按之字形顺序打印二叉树 【中等】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
28.二叉树的最大深度 【简单】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
29.二叉树中和为某一值的路径(一) 【简单】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
30.二叉搜索树与双向链表 【中等】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
31.对称的二叉树 【简单】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
32.合并二叉树 【简单】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
33.二叉树的镜像 【简单】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
34.判断是不是二叉搜索树 【中等】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
35.判断是不是完全二叉树 【中等】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
36.判断是不是平衡二叉树 【简单】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
37.二叉搜索树的最近公共祖先 【简单】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
38.在二叉树中找到两个节点的最近公共祖先 【中等】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
39.序列化二叉树 【较难】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
40.重建二叉树 【中等】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
41.输出二叉树的右视图 【中等】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
堆/栈/队列https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/#堆-栈-队列
42.用两个栈实现队列 【简单】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
43.包含min函数的栈 【简单】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
44.有效括号序列 【简单】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
45.滑动窗口的最大值 【较难】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
46.最小的K个数 【中等】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
47.寻找第K大 【中等】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
48.数据流中的中位数 【中等】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
49.表达式求值 【中等】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
哈希https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/#哈希
50.两数之和 【简单】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
51.数组中出现次数超过一半的数字 【简单】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
52.数组中只出现一次的两个数字 【中等】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
53.缺失的第一个正整数 【中等】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
54.三数之和 【中等】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
递归/回溯https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/#递归-回溯
55.没有重复项数字的全排列 【中等】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
56.有重复项数字的全排列 【中等】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
57.岛屿数量 【中等】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
58.字符串的排列 【中等】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
59.N皇后问题 【较难】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
60.括号生成 【中等】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
61.矩阵最长递增路径 【中等】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
动态规划https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/#动态规划
62.斐波那契数列 【入门】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/fibonacci.html
63.跳台阶 【简单】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/jumpFloor.html
64.小花费爬楼梯 【简单】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
65.最长公共子序列(二) 【中等】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
66.最长公共子串 【中等】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
67.不同路径的数目(一) 【简单】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
68.矩阵的最小路径和 【中等】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
69.把数字翻译成字符串 【中等】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
70.兑换零钱(一) 【中等】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
71.最长上升子序列(一) 【中等】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
72.连续子数组的最大和 【简单】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
73.最长回文子串 【中等】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
74.数字字符串转化成IP地址 【中等】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
75.编辑距离(一) 【较难】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
76.正则表达式匹配 【较难】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
77.最长的括号子串 【较难】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
78.打家劫舍(一) 【中等】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
79.打家劫舍(二) 【中等】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
80.买卖股票的最好时机(一) 【简单】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
81.买卖股票的最好时机(二) 【中等】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
82.买卖股票的最好时机(三) 【较难】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
字符串https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/#字符串
83.字符串变形 【简单】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
84.最长公共前缀 【简单】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
85.验证IP地址 【中等】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
86.大数加法 【中等】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
双指针https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/#双指针
87.合并两个有序的数组 【简单】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
88.判断是否为回文字符串 【入门】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
89.合并区间 【中等】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
90.最小覆盖子串 【较难】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
91.反转字符串 【入门】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
92.最长无重复子数组 【中等】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
93.盛水最多的容器 【中等】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
94.接雨水问题 【较难】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
贪心算法https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/#贪心算法
95.分糖果问题 【较难】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
96.主持人调度(二) 【中等】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
模拟https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/#模拟
97.旋转数组 【中等】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
98.螺旋矩阵 【简单】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
99.顺时针旋转矩阵 【中等】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
100.设计LRU缓存结构 【较难】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
101.设计LFU缓存结构 【较难】https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/
参考资料https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/#参考资料
https://www.nowcoder.com/exam/ojhttps://www.nowcoder.com/exam/oj
更新日志https://142vip.github.io/JavaScriptCollection/solo-algorithm/interview-101/#doc-changelog
编辑此页https://github.com/142vip/JavaScriptCollection/edit/next/docs/solo-algorithm/interview-101/README.md
下一页⚔️ 剑指Offerhttps://142vip.github.io/JavaScriptCollection/solo-algorithm/sword-point.html
@142viphttps://github.com/142vip
百度统计https://tongji.baidu.com/web/welcome/login
鄂ICP备17025193号-1https://beian.miit.gov.cn/#/Integrated/index
https://142vip.github.io/JavaScriptCollection
https://js-collection.vercel.app
https://js-collection.netlify.app

Viewport: width=device-width,initial-scale=1


URLs of crawlers that visited me.