# leetcode

**Repository Path**: ldtech007/leetcode

## Basic Information

- **Project Name**: leetcode
- **Description**: leetcode-blind75
- **Primary Language**: Unknown
- **License**: MIT
- **Default Branch**: main
- **Homepage**: None
- **GVP Project**: No

## Statistics

- **Stars**: 5
- **Forks**: 1
- **Created**: 2023-07-21
- **Last Updated**: 2025-10-30

## Categories & Tags

**Categories**: Uncategorized

**Tags**: None

## README

<p align="center">
  <a href="https://raw.githubusercontent.com/ldtech007/leetcode/main/picture/readme-01.jpg" target="_blank"><img src="https://img.shields.io/badge/公众号-编程网事-brightgreen.svg" alt="公众号"></a>
  <a href="https://docs.qq.com/sheet/DWGJZdmZSQUJvWWp3" target="_blank"><img src="https://img.shields.io/badge/共享文档-blind75-blue.svg" alt="共享文档"></a>
</p>


网络慢？ 点击&#x1F496; &#x1F496;**[gitee 同步仓库](https://gitee.com/ldtech007/leetcode)：&#x1F496; &#x1F496;** 

>https://gitee.com/ldtech007/leetcode

&#x1F496; &#x1F496;&#x1F496;**喜欢就给个star吧** &#x1F496;&#x1F496; &#x1F496;

# 求职刷题最佳实践

## 关于本仓库

本仓库主要是**基于`blind 75`列表中的题目写的题解**和**技术面试逻辑思维相关的文章**，后面还会不断增加一些程序员求职面试相关的东西，主要目的是帮助大家提高准备面试的效率。题解使用的语言是`C++`，不过不同语言的思路都是相通的，**也欢迎大家根据文中的思路提交不同语言的代码实现，在文中增加一个类似【C++代码】的标题填入代码即可**，鼓励大家提合并请求给我。

所有的文章都是我利用工作之余的时间写的，尽可能使用最简洁易懂的方式，由浅入深，还画了一些帮助理解的图片。每写完一篇我都会以小白的姿态去反复阅读，反复修改。 也获得了一些同学的认可，还有一些同学在力扣的题解评论区给我提建议，我也会根据同学们的建议去不断调整。我始终认为个人的思路是有局限性的，因为每个人对基础知识的掌握程度是不一样的，一个人认为理所当然的结论，另一个人可能想破脑袋都不理解，所以需要我们共同去不断完善。非常欢迎大家通过力扣评论、公众号后台给我提建议，或者直接提给我你的合并请求。

## blind 75 介绍

`blind 75`是力扣的一个题目列表，它最先由 `Facebook` 前工程师 `Yangshun` 发布在 `blind` 这个网站上，由于它几乎包含了求职面试中数据结构与算法所有必备的知识点，大大提高了准备面试的效率，迅速在`blind`网站上爆火，`blind 75` 由此得名。

`blind 75` 中的题目整体难度偏中等以下，非常适合刚开始刷题的同学拿来入门，或者是不愿意在刷题上投入过多时间的同学，这个仓库可以帮你达到事半功倍的效果。你不必再面对茫茫题海毫无头绪的盲目去刷，这里**既提供了经典题目列表，还提供了对应的高质量题解**，让刷题更有效率。

## blind 75 包含的知识点

此题目列表包含的知识点是比较全面的。

**常用的数据结构：** 数组、字符串、链表、二叉树、图、前缀树、集合、映射、栈、队列、堆都有覆盖。

**常用的解题方法：** 递归、迭代、二分法、回溯、贪心、动态规划、位运算、双指针、模拟、拓扑排序、桶排序、单调栈、深度优先搜索、广度优先搜索都有覆盖。

## 数据结构基础

[001.面试中需要熟知的数组知识](./%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E5%9F%BA%E7%A1%80/%E9%9D%A2%E8%AF%95%E4%B8%AD%E9%9C%80%E8%A6%81%E7%86%9F%E7%9F%A5%E7%9A%84%E6%95%B0%E7%BB%84%E7%9F%A5%E8%AF%86.md)

[002.面试中需要熟知的字符串知识](./%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E5%9F%BA%E7%A1%80/%E9%9D%A2%E8%AF%95%E4%B8%AD%E9%9C%80%E8%A6%81%E7%86%9F%E7%9F%A5%E7%9A%84%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9F%A5%E8%AF%86.md)

## blind75 目录

### 数组

[leetcode 1.两数之和](./leetcode%20blind75/数组/LeetCode%200001.两数之和.md)

[leetcode 121.买卖股票的最佳时机](./leetcode%20blind75/数组/LeetCode%200121.买卖股票的最佳时机.md)

[leetcode 217.存在重复元素](./leetcode%20blind75/数组/LeetCode%200217.存在重复元素.md)

[leetcode 238. 除自身以外数组的乘积](./leetcode%20blind75/数组/LeetCode%200238.%20除自身以外数组的乘积.md)

[leetcode 53.最大子数组和](./leetcode%20blind75/数组/LeetCode%200053.%20最大子数组和.md)

[leetcode 152.乘积最大子数组](./leetcode%20blind75/数组/LeetCode%200152.乘积最大子数组.md)

[leetcode 153.寻找旋转排序数组中的最小值](./leetcode%20blind75/数组/LeetCode%200153.%20寻找旋转排序数组中的最小值.md)

[leetcode 33.搜索旋转排序数组](./leetcode%20blind75/数组/LeetCode%200033.搜索旋转排序数组.md)

[leetcode 15.三数之和](./blind75/数组/LeetCode%200015.三数之和.md)

[leetcode 11.盛最多水的容器](./leetcode%20blind75/数组/LeetCode%200011.盛最多水的容器.md)

### 位运算

[leetcode 191.位1的个数](./leetcode%20blind75/位运算/LeetCode%200191.位1的个数.md)

[leetcode 338.比特位计数](./leetcode%20blind75/位运算/LeetCode%200338.%20比特位计数.md)

[leetcode 268.丢失的数字](./leetcode%20blind75/位运算/LeetCode%200268.丢失的数字.md)

[leetcode 190.颠倒二进制位](./leetcode%20blind75/位运算/LeetCode%200190.颠倒二进制位.md)

### 动态规划

[leetcode 70.爬楼梯](./leetcode%20blind75/动态规划/LeetCode%200070.爬楼梯.md)

[leetcode 322.零钱兑换](./leetcode%20blind75/动态规划/LeetCode%200322.零钱兑换.md)

[leetcode 300.最长递增子序列](./leetcode%20blind75/动态规划/LeetCode%200300.%20最长递增子序列.md)

[leetcode 1143.最长公共子序列](./leetcode%20blind75/动态规划/LeetCode%201143.%20最长公共子序列.md)

[leetcode 139.单词拆分](./leetcode%20blind75/动态规划/LeetCode%200139.%20单词拆分.md)

[leetcode 39.组合总和](./leetcode%20blind75/动态规划/LeetCode%200039.%20组合总和.md)

[leetcode 198.打家劫舍](./leetcode%20blind75/动态规划/LeetCode%200198.%20打家劫舍.md)

[leetcode 213.打家劫舍 II](./leetcode%20blind75/动态规划/LeetCode%200213.%20打家劫舍%20II.md)

[leetcode 91.解码方法](./leetcode%20blind75/动态规划/LeetCode%200091.%20解码方法.md)

[leetcode 62.不同路径](./leetcode%20blind75/动态规划/LeetCode%200062.%20不同路径.md)

[leetcode 55.跳跃游戏](./leetcode%20blind75/动态规划/LeetCode%200055.%20跳跃游戏.md)

### 图

[leetcode 133.克隆图](./leetcode%20blind75/图/LeetCode%200133.%20克隆图.md)

[leetcode 207.课程表](./leetcode%20blind75/图/LeetCode%200207.%20课程表.md)

[leetcode 417.太平洋大西洋水流问题](./leetcode%20blind75/图/LeetCode%200417.太平洋大西洋水流问题.md)

[leetcode 200.岛屿数量](./leetcode%20blind75/图/LeetCode%200200.岛屿的数量.md)

[leetcode 128.最长连续序列](./leetcode%20blind75/图/LeetCode%200128.%20最长连续序列.md)

### 区间

[leetcode 57.插入区间](./leetcode%20blind75/区间/LeetCode%200057.插入区间.md)

[leetcode 56.合并区间](./leetcode%20blind75/区间/LeetCode%200056.%20合并区间.md)

[leetcode 435.无重叠区间](./leetcode%20blind75/区间/LeetCode%200435.%20无重叠区间.md)

### 链表

[leetcode 206.反转链表](./leetcode%20blind75/链表/LeetCode%200206.%20反转链表.md)

[leetcode 141.环形链表](./leetcode%20blind75/链表/LeetCode%200141.环形链表.md)

[leetcode 21.合并两个有序链表](./leetcode%20blind75/链表/LeetCode%200021.%20合并两个有序链表.md)

[leetcode 23.合并 K 个升序链表](./leetcode%20blind75/链表/LeetCode%200023.%20合并%20K%20个升序链表.md)

[leetcode 19.删除链表的倒数第 N 个结点](./leetcode%20blind75/链表/LeetCode%200019.%20删除链表的倒数第%20N%20个结点.md)

[leetcode 143.重排链表](./leetcode%20blind75/链表/LeetCode%200143.%20重排链表.md)

### 矩阵

[leetcode 73.矩阵置零](./leetcode%20blind75/矩阵/LeetCode%200073.%20矩阵置零.md)

[leetcode 54.螺旋矩阵](./leetcode%20blind75/矩阵/LeetCode%200054.%20螺旋矩阵.md)

[leetcode 48.旋转图像](./leetcode%20blind75/矩阵/LeetCode%200048.%20旋转图像.md)

[leetcode 79.单词搜索](./leetcode%20blind75/矩阵/LeetCode%200079.%20单词搜索.md)

### 字符串

[leetcode 3.无重复字符的最长子串](./leetcode%20blind75/字符串/LeetCode%200003.无重复字符的最长子串.md)

[leetcode 424.替换后的最长重复字符](./leetcode%20blind75/字符串/LeetCode%200424.%20替换后的最长重复字符.md)

[leetcode 76.最小覆盖子串](./leetcode%20blind75/字符串/LeetCode%200076.%20最小覆盖子串.md)

[leetcode 242.有效的字母异位词](./leetcode%20blind75/字符串/LeetCode%200242.%20有效的字母异位词.md)

[leetcode 49.字母异位词分组](./leetcode%20blind75/字符串/LeetCode%200049.%20字母异位词分组.md)

[leetcode 20.有效的括号](./leetcode%20blind75/字符串/LeetCode%200020.有效括号.md)

[leetcode 125.验证回文串](./leetcode%20blind75/字符串/LeetCode%200125.%20验证回文串.md)

[leetcode 5.最长回文子串](./leetcode%20blind75/字符串/LeetCode%200005.%20最长回文子串.md)

[leetcode 647.回文子串](./leetcode%20blind75/字符串/LeetCode%200647.%20回文子串.md)

### 树

[leetcode 104.二叉树的最大深度](./leetcode%20blind75/树/LeetCode%200104.%20二叉树的最大深度.md)

[leetcode 100.相同的树](./leetcode%20blind75/树/LeetCode%200100.%20相同的树.md)

[leetcode 226.翻转二叉树](./leetcode%20blind75/树/LeetCode%200226.%20翻转二叉树.md)

[leetcode 124.二叉树中的最大路径和](./leetcode%20blind75/树/LeetCode%200124.%20二叉树中的最大路径和.md)

[leetcode 102.二叉树的层序遍历](./leetcode%20blind75/树/LeetCode%200102.%20二叉树的层序遍历.md)

[leetcode 297.二叉树的序列化与反序列化](./leetcode%20blind75/树/LeetCode%200297.%20二叉树的序列化与反序列化.md)

[leetcode 572.另一棵树的子树](./leetcode%20blind75/树/LeetCode%200572.%20另一棵树的子树.md)

[leetcode 105.从前序与中序遍历序列构造二叉树](./leetcode%20blind75/树/LeetCode%200105.%20从前序与中序遍历序列构造二叉树.md)

[leetcode 98.验证二叉搜索树](./leetcode%20blind75/树/LeetCode%200098.%20验证二叉搜索树.md)

[leetcode 230.二叉搜索树中第K小的元素](./leetcode%20blind75/树/LeetCode%200230.%20二叉搜索树中第K小的元素.md)

[leetcode 235.二叉搜索树的最近公共祖先](./leetcode%20blind75/树/LeetCode%200235.%20二叉搜索树的最近公共祖先.md)

[leetcode 208.实现 Trie (前缀树)](./leetcode%20blind75/树/LeetCode%200208.%20实现%20Trie%20(前缀树).md)

[leetcode 211.添加与搜索单词 - 数据结构设计](./leetcode%20blind75/树/LeetCode%200211.%20添加与搜索单词%20-%20数据结构设计.md)

[leetcode 212.单词搜索 II](./leetcode%20blind75/树/LeetCode%200212.%20单词搜索%20II.md)

### 堆

[leetcode 23.合并 K 个升序链表](./leetcode%20blind75/堆/LeetCode%200023.%20合并%20K%20个升序链表.md)

[leetcode 347.前 K 个高频元素](./leetcode%20blind75/堆/LeetCode%200347.%20前%20K%20个高频元素.md)

[leetcode 295.数据流的中位数](./leetcode%20blind75/堆/LeetCode%200295.%20数据流的中位数.md)

## 在线文档

我创建了一个在线文档&#x1F496; &#x1F496;  [点击直达](https://docs.qq.com/sheet/DWGJZdmZSQUJvWWp3) &#x1F496; &#x1F496; ，其中包含了题目链接以及对应题解的链接，更方便大家刷题过程中查阅，欢迎大家收藏。

> https://docs.qq.com/sheet/DWGJZdmZSQUJvWWp3


## 逻辑思维目录

[001.赛马](./逻辑思维/001.赛马.md)

[002.土匪也疯狂](./逻辑思维/002.土匪也疯狂.md)

[003.使用rand5实现rand7](./逻辑思维/003.使用rand5实现rand7.md)

[004.三门问题](./逻辑思维/004.三门问题.md)

[005.狼爱上羊？](./逻辑思维/005.狼爱上羊？.md)

[006.会玩的一家人](./%E9%80%BB%E8%BE%91%E6%80%9D%E7%BB%B4/006.%E4%BC%9A%E7%8E%A9%E7%9A%84%E4%B8%80%E5%AE%B6%E4%BA%BA.md)

[007.烧绳子](./逻辑思维/007.%E7%83%A7%E7%BB%B3%E5%AD%90.md)

[008.有问题的球](./%E9%80%BB%E8%BE%91%E6%80%9D%E7%BB%B4/008.%E6%9C%89%E9%97%AE%E9%A2%98%E7%9A%84%E7%90%83.md)

[009.蛋蛋破碎的临界点](./逻辑思维/009.蛋蛋破碎的临界点.md)

[010.通往offer之门](./逻辑思维/010.%E9%80%9A%E5%BE%80offer%E4%B9%8B%E9%97%A8.md)

[011.最后的颜色](./逻辑思维/011.%E6%9C%80%E5%90%8E%E7%9A%84%E9%A2%9C%E8%89%B2.md)

[012.贴标签](./%E9%80%BB%E8%BE%91%E6%80%9D%E7%BB%B4/012.%E8%B4%B4%E6%A0%87%E7%AD%BE.md)

持续更新中...

## 关于我

毕业于哈尔滨工业大学，曾在腾讯从事了 `3+` 年 `C++` 相关的开发工作，目前在一家大厂从事网络安全相关的工作。热爱技术分享，所有文章第一时间会发布在微信公众号，&#x1F496; &#x1F496; **喜欢我的文章就扫码关注吧** &#x1F496; &#x1F496;。

<div aglign="center">
    <img src="./picture/readme-01.jpg" width="50%">
</div>