41 lines
1.3 KiB
Markdown
41 lines
1.3 KiB
Markdown
---
|
||
title: LeetCode 题解笔记
|
||
description: 记录LeetCode算法题的解题思路和代码实现
|
||
createTime: 2025/09/22 08:09:52
|
||
permalink: /programming/leetcode/
|
||
---
|
||
|
||
# LeetCode 题解笔记
|
||
|
||
这里是我在LeetCode刷题过程中记录的解题思路和代码实现。通过整理这些题解，希望能够提高自己的算法水平和编程能力。
|
||
|
||
## 题解分类
|
||
|
||
### 数组与字符串
|
||
|
||
- [两数之和](https://leetcode-cn.com/problems/two-sum/)
|
||
- [三数之和](https://leetcode-cn.com/problems/3sum/)
|
||
|
||
### 链表
|
||
|
||
- [反转链表](https://leetcode-cn.com/problems/reverse-linked-list/)
|
||
- [合并两个有序链表](https://leetcode-cn.com/problems/merge-two-sorted-lists/)
|
||
|
||
### 动态规划
|
||
|
||
- [爬楼梯](https://leetcode-cn.com/problems/climbing-stairs/)
|
||
- [最长回文子串](https://leetcode-cn.com/problems/longest-palindromic-substring/)
|
||
|
||
## 解题技巧
|
||
|
||
1. **双指针法**：常用于数组、链表问题，如两数之和、反转链表等
|
||
2. **滑动窗口**：处理字符串子串问题
|
||
3. **动态规划**：将原问题分解为子问题，自底向上求解
|
||
4. **分治法**：将问题分成若干子问题，分别求解后合并结果
|
||
|
||
## 学习资源
|
||
|
||
- [LeetCode官方题解](https://leetcode-cn.com/problemset/all/)
|
||
- [代码随想录](https://programmercarl.com/)
|
||
- [算法导论](https://mitpress.mit.edu/books/introduction-algorithms)
|