https://github.com/leeexp3rt/leetcode-exercises
My coding exercises in LeetCode
https://github.com/leeexp3rt/leetcode-exercises
Last synced: 8 months ago
JSON representation
My coding exercises in LeetCode
- Host: GitHub
- URL: https://github.com/leeexp3rt/leetcode-exercises
- Owner: lEEExp3rt
- License: mit
- Created: 2025-02-20T16:16:47.000Z (over 1 year ago)
- Default Branch: main
- Last Pushed: 2025-02-21T13:58:42.000Z (over 1 year ago)
- Last Synced: 2025-02-21T14:34:04.563Z (over 1 year ago)
- Language: C++
- Size: 2.93 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# Leetcode 使用记录
本仓库用于记录我的 LeetCode 刷题记录
## Table Of Contents
- [1 - 两数之和](ans/1.cpp)[^1]
- [2 - 两数相加](ans/2.cpp)[^1]
- [3 -无重复字符的最长子串](ans/3.cpp)[^1]
- [11 - 盛最多水的容器](ans/11.cpp)[^1]
- [15 - 三数之和](ans/15.cpp)[^1]
- [17 - 电话号码的字母组合](ans/17.cpp)[^1]
- [19 - 删除链表的倒数第 N 个结点](ans/19.cpp)[^1]
- [20 - 有效的括号](ans/20.cpp)[^1]
- [21 - 合并两个有序链表](ans/21.cpp)[^1]
- [22 - 括号生成](ans/22.cpp)[^1]
- [23 - 合并K个升序链表](ans/23.cpp)[^1]
- [24 - 两两交换链表中的节点](ans/24.cpp)[^1]
- [25 - K 个一组翻转链表](ans/25.cpp)[^1]
- [33 - 搜索旋转数组](ans/33.cpp)[^1]
- [34 - 在排序数组中查找元素的第一个和最后一个位置](ans/34.cpp)[^1]
- [35 - 搜索插入位置](ans/35.cpp)[^1]
- [39 - 组合总和](ans/39.cpp)[^1]
- [41 - 缺失的第一个正数](ans/41.cpp)[^1]
- [42 - 接雨水](ans/42.cpp)[^1]
- [46 - 全排列](ans/46.cpp)[^1]
- [48 - 旋转图像](ans/48.cpp)[^1]
- [49 - 字母异位词分组](ans/49.cpp)[^1]
- [53 - 最大子数组和](ans/53.cpp)[^1]
- [54 - 螺旋矩阵](ans/54.cpp)[^1]
- [56 - 合并区间](ans/56.cpp)[^1]
- [73 - 矩阵置零](ans/73.cpp)[^1]
- [74 - 搜索二维矩阵](ans/74.cpp)[^1]
- [76 - 最小覆盖子串](ans/76.cpp)[^1]
- [78 - 子集](ans/78.cpp)[^1]
- [79 - 单词搜索](ans/79.cpp)[^1]
- [94 - 二叉树的中序遍历](ans/94.cpp)[^1]
- [98 - 验证二叉搜索树](ans/94.cpp)[^1]
- [101 - 对称二叉树](ans/101.cpp)[^1]
- [102 - 二叉树的层序遍历](ans/102.cpp)[^1]
- [104 - 二叉树的最大深度](ans/104.cpp)[^1]
- [105 - 从前序与中序遍历序列构造二叉树](ans/105.cpp)[^1]
- [108 - 将有序数组转换为二叉搜索树](ans/108.cpp)[^1]
- [114 - 二叉树展开为链表](ans/114.cpp)[^1]
- [124 - 二叉树的最大路径和](ans/124.cpp)[^1]
- [128 - 最长连续序列](ans/128.cpp)[^1]
- [136 - 只出现一次的数字](ans/136.cpp)[^1]
- [138 - 随机链表的复制](ans/138.cpp)[^1]
- [141 - 环形链表](ans/141.cpp)[^1]
- [142 - 环形链表 II](ans/142.cpp)[^1]
- [146 - LRU 缓存](ans/146.cpp)[^1]
- [148 - 排序链表](ans/148.cpp)[^1]
- [155 - 最小栈](ans/155.cpp)[^1]
- [160 - 相交链表](ans/160.cpp)[^1]
- [189 - 旋转数组](ans/189.cpp)[^1]
- [199 - 二叉树的右视图](ans/199.cpp)[^1]
- [200 - 岛屿数量](ans/200.cpp)[^1]
- [206 - 反转链表](ans/206.cpp)[^1]
- [207 - 课程表](ans/207.cpp)[^1]
- [208 - 实现 Trie（前缀树）](ans/208.cpp)[^1]
- [215 - 数组中的第K个最大元素](ans/215.cpp)[^1]
- [226 - 翻转二叉树](ans/226.cpp)[^1]
- [230 - 二叉搜索树中第K小的元素](ans/230.cpp)[^1]
- [234 - 回文链表](ans/234.cpp)[^1]
- [236 - 二叉搜索树的最近公共祖先](ans/236.cpp)[^1]
- [238 - 除自身以外数组的乘积](ans/238.cpp)[^1]
- [239 - 滑动窗口最大值](ans/239.cpp)[^1]
- [240 - 搜索二维矩阵 II](ans/240.cpp)[^1]
- [283 - 移动零](ans/283.cpp)[^1]
- [437 - 路径总和 III](ans/437.cpp)[^1]
- [438 - 找到字符串中所有字母异位词](ans/438.cpp)[^1]
- [543 - 二叉树的直径](ans/543.cpp)[^1]
- [560 - 和为K的最长子数组](ans/560.cpp)[^1]
- [994 - 腐烂的橘子](ans/994.cpp)[^1]
- [2353 - 设计事物评分系统](ans/2353.cpp)[^2]
- [2610 - 转换二维数组](ans/2610.cpp)[^2]
- [3110 - 字符串的分数](ans/3110.cpp)[^2]
- [3340 - 检查平衡字符串](ans/3340.cpp)[^2]
[^1]: [LeetCode热题100](https://leetcode.cn/studyplan/top-100-liked)
[^2]: LeetCode每日一题