# LeetCode

**Repository Path**: satelliter63/leet-code

## Basic Information

- **Project Name**: LeetCode
- **Description**: 用来保存力扣或其他平台的刷题记录
- **Primary Language**: C++
- **License**: Not specified
- **Default Branch**: master
- **Homepage**: None
- **GVP Project**: No

## Statistics

- **Stars**: 0
- **Forks**: 0
- **Created**: 2022-03-09
- **Last Updated**: 2025-11-16

## Categories & Tags

**Categories**: Uncategorized

**Tags**: None

## README

# 不定期更新算法刷题记录（C++）
备注：早期参加牛客网、本校算法竞赛、校OJ刷题、组内算法等练习时比较杂，目前偶尔遇到相关算法时会复习并整理进本仓库中，而大多数其他平台上的刷题记录并未对接到本仓库中

## 更新记录
翻找以前的旧电脑，将当时的刷题记录同步到本仓库中
旧代码同步在`c,c++`等文件夹中。

## 经典算法题

| 相关经典算法以及我的题解链接 |
|  ----  |
| [01背包.cpp](/Algorithm/01%E8%83%8C%E5%8C%85.cpp) |
| [最大K乘积问题.cpp](/Algorithm/%E6%9C%80%E5%A4%A7K%E4%B9%98%E7%A7%AF%E9%97%AE%E9%A2%98.cpp) |
| [N皇后(DFS).cpp](/Algorithm/N%E7%9A%87%E5%90%8E.cpp) |
| [线数目(深搜DFS).cpp](/Algorithm/%E7%BA%BF%E6%95%B0%E7%9B%AE(%E6%B7%B1%E6%90%9CDFS).cpp) |
| [全排列.cpp](/Algorithm/%E5%85%A8%E6%8E%92%E5%88%97.cpp) |
| [文章格式(词组处理)](/Algorithm/%E6%96%87%E7%AB%A0%E6%A0%BC%E5%BC%8F.cpp) |
| [圣诞广场(深搜+动态规划).cpp](/Algorithm/%E5%9C%A3%E8%AF%9E%E5%B9%BF%E5%9C%BA(%E6%B7%B1%E6%90%9C%2B%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92).cpp) |
| [寻找最大数(贪心).cpp](/Algorithm/%E5%AF%BB%E6%89%BE%E6%9C%80%E5%A4%A7%E6%95%B0(%E8%B4%AA%E5%BF%83).cpp) |
| [取石子(博弈论).cpp](/Algorithm/%E5%8F%96%E7%9F%B3%E5%AD%90(%E5%8D%9A%E5%BC%88%E8%AE%BA).cpp) |
| [寻找第K大值(分治思想).cpp](/Algorithm/%E5%AF%BB%E6%89%BE%E7%AC%ACK%E5%A4%A7%E5%80%BC(%E5%88%86%E6%B2%BB%E6%80%9D%E6%83%B3).cpp) |
| [邮差送信(图论+深搜).cpp](/Algorithm/%E9%82%AE%E5%B7%AE%E9%80%81%E4%BF%A1(%E5%9B%BE%E8%AE%BA+%E6%B7%B1%E6%90%9C).cpp) |
| [最长不降子序列(DP).cpp](/Algorithm/%E6%9C%80%E9%95%BF%E4%B8%8D%E9%99%8D%E5%AD%90%E5%BA%8F%E5%88%97(DP).cpp) |
| [滑雪(DFS+DP).cpp](/Algorithm/%E6%BB%91%E9%9B%AA(DFS+DP).cpp) |
| [希尔排序.cpp](/Algorithm/%E5%B8%8C%E5%B0%94%E6%8E%92%E5%BA%8F.cpp) |

</hr>

## Leetcode
| 题目序号 | 原题链接 | 我的题解文件链接 |
|  ----  | ----  | ----  |
| 1  | [two-sum](https://leetcode-cn.com/problems/two-sum/) | [模拟](/leetcode/1.cpp) |
| 9  | [palindrome-number](https://leetcode-cn.com/problems/palindrome-number/) | [模拟](/leetcode/9.cpp) |
| 258  | [add-digits](https://leetcode-cn.com/problems/add-digits/) | [数学+简单动规](/leetcode/258.cpp) |
| 2104  | [sum-of-subarray-ranges](https://leetcode-cn.com/problems/sum-of-subarray-ranges/) | [模拟](/leetcode/2104.cpp) |
| 504  | [base-7](https://leetcode-cn.com/problems/base-7/) | [模拟](/leetcode/504.cpp) |
| 512  | [longest-uncommon-subsequence-i](https://leetcode-cn.com/problems/longest-uncommon-subsequence-i/) | [脑经急转弯](/leetcode/512.cpp) |
| 2055  | [plates-between-candles](https://leetcode-cn.com/problems/plates-between-candles/) | [前缀和](/leetcode/2055.cpp) |
| 2100  | [find-good-days-to-rob-the-bank](https://leetcode-cn.com/problems/find-good-days-to-rob-the-bank/) | [动态规划](/leetcode/2100.cpp) |
| 398  | [random-pick-index](https://leetcode-cn.com/problems/random-pick-index/) | [蓄水池抽样](/leetcode/398.cpp) |
| 798  | [smallest-rotation-with-highest-score](https://leetcode-cn.com/problems/smallest-rotation-with-highest-score/) | [差分数组+数学+轻微动规](/leetcode/798.cpp) |
| 589 | [n-ary-tree-preorder-traversal](https://leetcode-cn.com/problems/n-ary-tree-preorder-traversal) | [数据结构(N叉树)](/leetcode/589.cpp) |
| 2049 | [count-nodes-with-the-highest-score](https://leetcode-cn.com/problems/count-nodes-with-the-highest-score/) | [二叉树+DFS](/leetcode/2049.cpp) |
| 590 | [n-ary-tree-postorder-traversal](https://leetcode-cn.com/problems/n-ary-tree-postorder-traversal/) | [数据结构(N叉树，后序版本)](/leetcode/590.cpp) |
| 70 | [爬楼梯](https://leetcode-cn.com/problems/climbing-stairs/) | [动态规划，斐波那契数列](/leetcode/70%E7%88%AC%E6%A5%BC%E6%A2%AF.cpp) |
| 806 | [写字符串需要的行数](https://leetcode-cn.com/problems/number-of-lines-to-write-string/) | [字符串处理，简单模拟](/leetcode/806%E5%86%99%E5%AD%97%E7%AC%A6%E4%B8%B2%E9%9C%80%E8%A6%81%E7%9A%84%E8%A1%8C%E6%95%B0.cpp) |
| 405 | [数字转换为十六进制数](https://leetcode-cn.com/problems/convert-a-number-to-hexadecimal/) | [进制转换，位运算](/leetcode/AlgorithmCollection_01/405.%20%E6%95%B0%E5%AD%97%E8%BD%AC%E6%8D%A2%E4%B8%BA%E5%8D%81%E5%85%AD%E8%BF%9B%E5%88%B6%E6%95%B0.cpp) |
| 108 | [将有序数组转换为二叉搜索树](https://leetcode.cn/problems/convert-sorted-array-to-binary-search-tree/) | [二分法，中序遍历](/leetcode/108%20%E5%B0%86%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84%E8%BD%AC%E6%8D%A2%E4%B8%BA%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91.cpp) |
| 105 | [从前序与中序遍历序列构造二叉树](https://leetcode.cn/problems/construct-binary-tree-from-preorder-and-inorder-traversal/) | [辅助栈，迭代法](/leetcode/105.%20%E4%BB%8E%E5%89%8D%E5%BA%8F%E4%B8%8E%E4%B8%AD%E5%BA%8F%E9%81%8D%E5%8E%86%E5%BA%8F%E5%88%97%E6%9E%84%E9%80%A0%E4%BA%8C%E5%8F%89%E6%A0%91.cpp) |
| 199 | [二叉树的右视图](https://leetcode.cn/problems/binary-tree-right-side-view/) | [广搜/深搜，数据结构](/leetcode/199.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%8F%B3%E8%A7%86%E5%9B%BE.cpp) |
| 113 | [路径总和 II](https://leetcode.cn/problems/path-sum-ii/) | [深搜，回溯，二叉树](leetcode/113.%20%E8%B7%AF%E5%BE%84%E6%80%BB%E5%92%8C%20II.cpp) |
| 1557 | [可以到达所有点的最少点数目](https://leetcode.cn/problems/minimum-number-of-vertices-to-reach-all-nodes/) | [图论](/leetcode/1557.%20%E5%8F%AF%E4%BB%A5%E5%88%B0%E8%BE%BE%E6%89%80%E6%9C%89%E7%82%B9%E7%9A%84%E6%9C%80%E5%B0%91%E7%82%B9%E6%95%B0%E7%9B%AE.cpp) |
| 34 | [在排序数组中查找元素的第一个和最后一个位置](https://leetcode.cn/problems/find-first-and-last-position-of-element-in-sorted-array/) | [二分法](/leetcode/34.%20%E5%9C%A8%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E6%9F%A5%E6%89%BE%E5%85%83%E7%B4%A0%E7%9A%84%E7%AC%AC%E4%B8%80%E4%B8%AA%E5%92%8C%E6%9C%80%E5%90%8E%E4%B8%80%E4%B8%AA%E4%BD%8D%E7%BD%AE.cpp) |
| 142 | [环形链表 II](https://leetcode.cn/problems/linked-list-cycle-ii/) | [快慢指针，数学推导](/leetcode/142.%20%E7%8E%AF%E5%BD%A2%E9%93%BE%E8%A1%A8%20II.cpp) |
| 213 | [打家劫舍 II](https://leetcode.cn/problems/house-robber-ii/) | [动态规划](/leetcode/213.%20%E6%89%93%E5%AE%B6%E5%8A%AB%E8%88%8D%20II.cpp) |
| 230 | [二叉搜索树中第K小的元素](https://leetcode.cn/problems/kth-smallest-element-in-a-bst/) | [二叉搜索树，优先队列/中序遍历](/leetcode/230.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E4%B8%AD%E7%AC%ACK%E5%B0%8F%E7%9A%84%E5%85%83%E7%B4%A0.cpp) |
| 547 | [省份数量](https://leetcode.cn/problems/number-of-provinces/) | [DFS/BFS/并查集](/leetcode/547.%20%E7%9C%81%E4%BB%BD%E6%95%B0%E9%87%8F.cpp) |
| 82 | [删除排序链表中的重复元素 II](https://leetcode.cn/problems/remove-duplicates-from-sorted-list-ii/) | [双指针、链表](/leetcode/82%E5%88%A0%E9%99%A4%E6%8E%92%E5%BA%8F%E9%93%BE%E8%A1%A8%E4%B8%AD%E7%9A%84%E9%87%8D%E5%A4%8D%E5%85%83%E7%B4%A0%20II.cpp) |

| 算法合集 | | |
|  ----  | ----  | ----  |
| 剑指 Offer 10- I | [原题](https://leetcode-cn.com/problems/fei-bo-na-qi-shu-lie-lcof/) | [记忆化搜索，快速幂，斐波那契数列](/leetcode/AlgorithmCollection_01/%E5%89%91%E6%8C%87Offer10-I.cpp) |
| 剑指 Offer 09 | [用两个栈实现队列](https://leetcode.cn/problems/yong-liang-ge-zhan-shi-xian-dui-lie-lcof/) | [普通双指针顺序队列](/leetcode/AlgorithmCollection_01/%E5%89%91%E6%8C%87%20Offer09%E7%94%A8%E4%B8%A4%E4%B8%AA%E6%A0%88%E5%AE%9E%E7%8E%B0%E9%98%9F%E5%88%97.cpp)
| 剑指 Offer 30 | [包含min函数的栈](https://leetcode.cn/problems/bao-han-minhan-shu-de-zhan-lcof/) | [辅助栈解决栈内最小值问题](/leetcode/AlgorithmCollection_01/%E5%89%91%E6%8C%87%20Offer30%E5%8C%85%E5%90%ABmin%E5%87%BD%E6%95%B0%E7%9A%84%E6%A0%88.cpp) |
| 剑指 Offer06 | [从头到尾打印链表](https://leetcode.cn/problems/cong-wei-dao-tou-da-yin-lian-biao-lcof/) | [辅助栈/递归](/leetcode/%E5%89%91%E6%8C%87%20Offer06.%E4%BB%8E%E5%B0%BE%E5%88%B0%E5%A4%B4%E6%89%93%E5%8D%B0%E9%93%BE%E8%A1%A8.cpp) |
| 剑指 Offer24 | [反转链表](https://leetcode.cn/problems/fan-zhuan-lian-biao-lcof/) | [递归解决链表问题](/leetcode/%E5%89%91%E6%8C%87Offer24%E5%8F%8D%E8%BD%AC%E9%93%BE%E8%A1%A8.cpp) |
| 剑指 Offer35 | [复杂链表的复制](https://leetcode.cn/problems/fu-za-lian-biao-de-fu-zhi-lcof/) | [哈希表解决深拷贝问题](/leetcode/%E5%89%91%E6%8C%87Offer35%E5%A4%8D%E6%9D%82%E9%93%BE%E8%A1%A8%E7%9A%84%E5%A4%8D%E5%88%B6.cpp) |
| 剑指 Offer53-I | [在排序数组中查找数字](https://leetcode.cn/problems/zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof/) | [哈希表](/leetcode/剑指%20Offer53-II0～n-1中缺失的数字.cpp) |
| 剑指 Offer53-II | [0~n-1中缺失的数字](https://leetcode.cn/problems/que-shi-de-shu-zi-lcof/) | [二分法、哈希表、数学逻辑](/leetcode/剑指%20Offer53-II0～n-1中缺失的数字.cpp) |
| 剑指 Offer04 | [二维数组中的查找](https://leetcode.cn/problems/er-wei-shu-zu-zhong-de-cha-zhao-lcof/) | [二分法、分治](/leetcode/%E5%89%91%E6%8C%87%20Offer04%E4%BA%8C%E7%BB%B4%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E6%9F%A5%E6%89%BE.cpp) |
| 剑指 Offer11 | [旋转数组的最小数字](https://leetcode.cn/problems/xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof/) | [二分查找](/leetcode/%E5%89%91%E6%8C%87%20Offer11%E6%97%8B%E8%BD%AC%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%B0%8F%E6%95%B0%E5%AD%97.cpp) |
| 剑指 Offer50 | [第一个只出现一次的字符](https://leetcode.cn/problems/di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof/) | [哈希表](/leetcode/%E5%89%91%E6%8C%87%20Offer50%E7%AC%AC%E4%B8%80%E4%B8%AA%E5%8F%AA%E5%87%BA%E7%8E%B0%E4%B8%80%E6%AC%A1%E7%9A%84%E5%AD%97%E7%AC%A6.cpp) |
| 剑指 Offer32 | [从上到下打印二叉树](https://leetcode.cn/problems/cong-shang-dao-xia-da-yin-er-cha-shu-lcof/) | [BFS、二叉树](/leetcode/%E5%89%91%E6%8C%87%20Offer32%20-%20I%E4%BB%8E%E4%B8%8A%E5%88%B0%E4%B8%8B%E6%89%93%E5%8D%B0%E4%BA%8C%E5%8F%89%E6%A0%91.cpp) |
| 剑指 Offer10-II | [青蛙跳台阶问题](https://leetcode.cn/problems/qing-wa-tiao-tai-jie-wen-ti-lcof/) | [动态规划](/leetcode/%E5%89%91%E6%8C%87%20Offer%2010-%20II.%20%E9%9D%92%E8%9B%99%E8%B7%B3%E5%8F%B0%E9%98%B6%E9%97%AE%E9%A2%98.cpp) |

<hr/>

## PAT

| 题目序号 | 原题链接 | 我的题解文件链接 |
|  ----  | ----  | ----  |
| 1019 数字黑洞 | [原题](https://pintia.cn/problem-sets/994805260223102976/problems/994805302786899968) | [模拟](/PAT/1019%20%E6%95%B0%E5%AD%97%E9%BB%91%E6%B4%9E.cpp) |
| 1003 我要通过 | [原题](https://pintia.cn/problem-sets/994805260223102976/problems/994805323154440192) | [字符串子串处理](/PAT/1003%20%E6%88%91%E8%A6%81%E9%80%9A%E8%BF%87.cpp) |
| 1004 成绩排名 | [原题](https://pintia.cn/problem-sets/994805260223102976/problems/994805321640296448) | [数据统计与处理](/PAT/1004%20%E6%88%90%E7%BB%A9%E6%8E%92%E5%90%8D.cpp) |
| 1007 素数对猜想 | [原题](https://pintia.cn/problem-sets/994805260223102976/problems/994805317546655744) | [欧拉筛算法](/PAT/1007%20%E7%B4%A0%E6%95%B0%E5%AF%B9%E7%8C%9C%E6%83%B3.cpp) |
| 1008 数组元素循环右移问题 | [原题](https://pintia.cn/problem-sets/994805260223102976/problems/994805316250615808) | [数组处理+思维题](/PAT/1008%20%E6%95%B0%E7%BB%84%E5%85%83%E7%B4%A0%E5%BE%AA%E7%8E%AF%E5%8F%B3%E7%A7%BB%E9%97%AE%E9%A2%98.cpp) |
| 405. 数字转换为十六进制数 | [原题](https://leetcode-cn.com/problems/convert-a-number-to-hexadecimal/) | [位运算+进制转换](/leetcode/AlgorithmCollection_01/405.%20%E6%95%B0%E5%AD%97%E8%BD%AC%E6%8D%A2%E4%B8%BA%E5%8D%81%E5%85%AD%E8%BF%9B%E5%88%B6%E6%95%B0.cpp) |
| 1015 德才论 | [题目详情 - 1015 德才论 (pintia.cn)](https://pintia.cn/problem-sets/994805260223102976/problems/994805307551629312) | [数据统计](/PAT/) |
| 1017 A除以B | [1017 A除以B](https://pintia.cn/problem-sets/994805260223102976/problems/994805305181847552) | [高精度算法(除法)](/PAT/1017%20A%E9%99%A4%E4%BB%A5B(%E5%A4%A7%E6%95%B0%E9%99%A4%E6%B3%95).cpp) |
| 1030 完美数列 | [题目详情 - 1030 完美数列 (pintia.cn)](https://pintia.cn/problem-sets/994805260223102976/problems/994805291311284224) | [数列处理+剪枝](/PAT/1030%20%E5%AE%8C%E7%BE%8E%E6%95%B0%E5%88%97.cpp) |
| 1020 月饼                 | [题目详情 - 1020 月饼 (pintia.cn)](https://pintia.cn/problem-sets/994805260223102976/problems/994805301562163200) | [数据处理](/PAT/1020%20%E6%9C%88%E9%A5%BC.cpp)                                                     |
| 1037 在霍格沃茨找零钱 | [题目详情 - 1037 在霍格沃茨找零钱 (pintia.cn)](https://pintia.cn/problem-sets/994805260223102976/problems/994805284923359232) | [模拟](/PAT/1037%20%E5%9C%A8%E9%9C%8D%E6%A0%BC%E6%B2%83%E8%8C%A8%E6%89%BE%E9%9B%B6%E9%92%B1.cpp) |
| 1066 图像过滤 | [题目详情 - 1066 图像过滤 (pintia.cn)](https://pintia.cn/problem-sets/994805260223102976/problems/994805266514558976) | [数据处理](/PAT/1066%20%E5%9B%BE%E5%83%8F%E8%BF%87%E6%BB%A4.cpp) |