Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/217heidai/leetcode
leetcode
https://github.com/217heidai/leetcode
leetcode
Last synced: 25 days ago
JSON representation
leetcode
- Host: GitHub
- URL: https://github.com/217heidai/leetcode
- Owner: 217heidai
- Created: 2018-12-18T08:30:38.000Z (about 6 years ago)
- Default Branch: master
- Last Pushed: 2020-01-16T06:53:51.000Z (about 5 years ago)
- Last Synced: 2025-01-14T14:04:43.091Z (about 1 month ago)
- Topics: leetcode
- Language: Python
- Homepage: https://leetcode-cn.com/problemset/algorithms/
- Size: 97.7 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# LeetCode算法题库练习
[LeetCode中国](https://leetcode-cn.com/problemset/algorithms/)
# 语言
Python
# 题库
| 序号 | LeetCode题号 | 题目 | 难度 | 代码 |
| :------: | :------: | --- | :------: | :------: |
| 1 | 2 | [两数相加](https://leetcode-cn.com/problems/add-two-numbers/) | 中等 | [点这里](https://github.com/217heidai/leetcode/blob/master/Python/leetcode0002.py) |
| 2 | 3 | [无重复字符的最长子串](https://leetcode-cn.com/problems/longest-substring-without-repeating-characters/) | 中等 | [点这里](https://github.com/217heidai/leetcode/blob/master/Python/leetcode0003.py)|
| 3 | 4 | [寻找两个有序数组的中位数](https://leetcode-cn.com/problems/median-of-two-sorted-arrays/) | 困难 | [点这里](https://github.com/217heidai/leetcode/blob/master/Python/leetcode0004.py) |
| 4 | 5 | [最长回文子串](https://leetcode-cn.com/problems/longest-palindromic-substring/) | 中等 | [点这里](https://github.com/217heidai/leetcode/blob/master/Python/leetcode0005.py) |
| 5 | 6 | [Z字形变换](https://leetcode-cn.com/problems/zigzag-conversion/) | 中等 | [点这里](https://github.com/217heidai/leetcode/blob/master/Python/leetcode0006.py) |
| 6 | 8 | [字符串转换整数 (atoi)](https://leetcode-cn.com/problems/string-to-integer-atoi/) | 中等 | [点这里](https://github.com/217heidai/leetcode/blob/master/Python/leetcode0008.py) |
| 7 | 10 | [正则表达式匹配](https://leetcode-cn.com/problems/regular-expression-matching/) | 困难 | 待处理 |
| 8 | 11 | [盛最多水的容器](https://leetcode-cn.com/problems/container-with-most-water/) | 中等 | [点这里](https://github.com/217heidai/leetcode/blob/master/Python/leetcode0011.py) |
| 9 | 12 | [整数转罗马数字](https://leetcode-cn.com/problems/integer-to-roman/) | 中等 | [点这里](https://github.com/217heidai/leetcode/blob/master/Python/leetcode0012.py) |
| 10 | 15 | [三数之和](https://leetcode-cn.com/problems/3sum/) | 中等 | [点这里](https://github.com/217heidai/leetcode/blob/master/Python/leetcode0015.py) |
| 11 | 16 | [最接近的三数之和](https://leetcode-cn.com/problems/3sum-closest/) | 中等 | [点这里](https://github.com/217heidai/leetcode/blob/master/Python/leetcode0016.py) |
| 12 | 17 | [电话号码的字母组合](https://leetcode-cn.com/problems/letter-combinations-of-a-phone-number/) | 中等 | [点这里](https://github.com/217heidai/leetcode/blob/master/Python/leetcode0017.py) |
| 13 | 18 | [四数之和](https://leetcode-cn.com/problems/4sum/) | 中等 | [点这里](https://github.com/217heidai/leetcode/blob/master/Python/leetcode0018.py) |
| 14 | 19 | [删除链表的倒数第N个节点](https://leetcode-cn.com/problems/remove-nth-node-from-end-of-list/) | 中等 | [点这里](https://github.com/217heidai/leetcode/blob/master/Python/leetcode0019.py) |
| 15 | 22 | [括号生成](https://leetcode-cn.com/problems/generate-parentheses/) | 中等 | [点这里](https://github.com/217heidai/leetcode/blob/master/Python/leetcode0022.py) |
| 16 | 23 | [合并K个排序链表](https://leetcode-cn.com/problems/merge-k-sorted-lists/) | 困难 | [点这里](https://github.com/217heidai/leetcode/blob/master/Python/leetcode0023.py) |
| 17 | 24 | [两两交换链表中的节点](https://leetcode-cn.com/problems/swap-nodes-in-pairs/) | 中等 | [点这里](https://github.com/217heidai/leetcode/blob/master/Python/leetcode0024.py) |
| 18 | 25 | [k个一组翻转链表](https://leetcode-cn.com/problems/reverse-nodes-in-k-group/) | 困难 | [点这里](https://github.com/217heidai/leetcode/blob/master/Python/leetcode0025.py) |
| 19 | 29 | [两数相除](https://leetcode-cn.com/problems/divide-two-integers/) | 困难 | [点这里](https://github.com/217heidai/leetcode/blob/master/Python/leetcode0029.py) |