Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.
Awesome Lists | Featured Topics | Projects
https://github.com/pinple/leetcode

👯‍♀️给脑细胞做做体操
https://github.com/pinple/leetcode
leetcode leetcode-cn leetcode-python
Last synced: about 1 month ago
JSON representation
👯‍♀️给脑细胞做做体操
Host: GitHub
URL: https://github.com/pinple/leetcode
Owner: pinple
License: apache-2.0
Created: 2018-09-21T13:21:17.000Z (over 6 years ago)
Default Branch: master
Last Pushed: 2019-04-03T14:54:04.000Z (over 5 years ago)
Last Synced: 2024-10-29T19:58:30.686Z (2 months ago)
Topics: leetcode, leetcode-cn, leetcode-python
Language: Python
Homepage:
Size: 74.2 KB
Stars: 2
Watchers: 0
Forks: 0
Open Issues: 0
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project

README

        # 题目列表

## 简单难度

| 题目                                                         | 难度 | 解答                                                         |

| :----------------------------------------------------------- | :--- | :----------------------------------------------------------- |

| [1.两数之和](https://leetcode-cn.com/problems/two-sum)       | 简单 | [python](https://github.com/Neulana/leetcode/blob/master/array/two-sum.py) |

| [7.反转整数](https://leetcode-cn.com/problems/reverse-integer) | 简单 | [python](https://github.com/Neulana/leetcode/blob/master/mathematics/reverse-integer.py) |

| [9.回文数](https://leetcode-cn.com/problems/palindrome-number) | 简单 | [python](https://github.com/Neulana/leetcode/blob/master/mathematics/palindrome-number.py) |

| [13.罗马数字转整数](https://leetcode-cn.com/problems/roman-to-integer) | 简单 | [python](https://github.com/Neulana/leetcode/blob/master/mathematics/roman-to-integer.py) |

| [14.最长公共前缀](https://leetcode-cn.com/problems/longest-common-prefix) | 简单 | [python](https://github.com/Neulana/leetcode/blob/master/string/longest-common-prefix.py) |

| [20.有效的括号](https://leetcode-cn.com/problems/valid-parentheses) | 简单 | [python](https://github.com/Neulana/leetcode/blob/master/stack/valid-parentheses.py) |

| [21.合并两个有序链表](https://leetcode-cn.com/problems/merge-two-sorted-lists) | 简单 | [python](https://github.com/Neulana/leetcode/blob/master/linkedlist/merge-two-sorted-lists.py) |

| [26.删除排序数组中的重复项](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-array) | 简单 | [python](https://github.com/Neulana/leetcode/blob/master/array/remove-duplicates-from-sorted-array.py) |

| [27.移除元素](https://leetcode-cn.com/problems/remove-element) | 简单 | [python](https://github.com/Neulana/leetcode/blob/master/array/remove-element.py) |

| [28.实现strStr()](https://leetcode-cn.com/problems/implement-strstr) | 简单 | [python](https://github.com/Neulana/leetcode/blob/master/string/implement-strstr.py) |

| [35.搜索插入位置](https://leetcode-cn.com/problems/search-insert-position) | 简单 | [python](https://github.com/Neulana/leetcode/blob/master/array/search-insert-position.py) |

| [38.报数](https://leetcode-cn.com/problems/count-and-say)    | 简单 | [python](https://github.com/Neulana/leetcode/blob/master/string/count-and-say.py) |

| [53.最大子序和](https://leetcode-cn.com/problems/maximum-subarray) | 简单 | [python](https://github.com/Neulana/leetcode/blob/master/dp/maximum-subarray.py) |

| [58.最后一个单词的长度](https://leetcode-cn.com/problems/length-of-last-word) | 简单 | [python](https://github.com/Neulana/leetcode/blob/master/string/length-of-last-word.py) |

| [66.加一](https://leetcode-cn.com/problems/plus-one)         | 简单 | [python](https://github.com/Neulana/leetcode/blob/master/array/plus-one.py) |

| [67.二进制求和](https://leetcode-cn.com/problems/add-binary) | 简单 | [python](https://github.com/Neulana/leetcode/blob/master/string/add-binary.py) |

| [69.x 的平方根](https://leetcode-cn.com/problems/sqrtx)      | 简单 | [python](https://github.com/Neulana/leetcode/blob/master/mathematics/sqrtx.py) |

| [70.爬楼梯](https://leetcode-cn.com/problems/climbing-stairs) | 简单 | [python](https://github.com/Neulana/leetcode/blob/master/dp/climbing-stairs.py) |

| [83.删除排序链表中的重复元素](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-list) | 简单 | [python](https://github.com/Neulana/leetcode/blob/master/linkedlist/remove-duplicates-from-sorted-list.py) |

| [88.合并两个有序数组](https://leetcode-cn.com/problems/merge-sorted-array) | 简单 | [python](https://github.com/Neulana/leetcode/blob/master/array/merge-sorted-array.py) |

| [100.相同的树](https://leetcode-cn.com/problems/same-tree)   | 简单 | [python](https://github.com/Neulana/leetcode/blob/master/tree/same-tree.py) |

| [101.对称二叉树](https://leetcode-cn.com/problems/symmetric-tree) | 简单 | [python](https://github.com/Neulana/leetcode/blob/master/tree/symmetric-tree.py) |

| [104.二叉树的最大深度](https://leetcode-cn.com/problems/maximum-depth-of-binary-tree) | 简单 | [python](https://github.com/Neulana/leetcode/blob/master/tree/maximum-depth-of-binary-tree.py) |

| [107.二叉树的层次遍历 II](https://leetcode-cn.com/problems/binary-tree-level-order-traversal-ii) | 简单 | [python](https://github.com/Neulana/leetcode/blob/master/tree/binary-tree-level-order-traversal-ii.py) |

| [108.将有序数组转换为二叉搜索树](https://leetcode-cn.com/problems/convert-sorted-array-to-binary-search-tree) | 简单 | [python](https://github.com/Neulana/leetcode/blob/master/tree/convert-sorted-array-to-binary-search-tree.py) |

| [110.平衡二叉树](https://leetcode-cn.com/problems/balanced-binary-tree) | 简单 | [python](https://github.com/Neulana/leetcode/blob/master/tree/balanced-binary-tree.py) |

| [111.二叉树的最小深度](https://leetcode-cn.com/problems/minimum-depth-of-binary-tree) | 简单 | [python](https://github.com/Neulana/leetcode/blob/master/tree/minimum-depth-of-binary-tree.py) |

| [112.路径总和](https://leetcode-cn.com/problems/path-sum)    | 简单 | [python](https://github.com/Neulana/leetcode/blob/master/tree/path-sum.py) |

| [118.杨辉三角](https://leetcode-cn.com/problems/pascals-triangle) | 简单 | [python](https://github.com/Neulana/leetcode/blob/master/mathematics/pascals-triangle.py) |

| [119.杨辉三角 II](https://leetcode-cn.com/problems/pascals-triangle-ii) | 简单 | [python](https://github.com/Neulana/leetcode/blob/master/mathematics/pascals-triangle-ii.py) |

| [121. 买卖股票的最佳时机](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock/) | 简单 | [python](https://github.com/Neulana/leetcode/blob/master/array/best-time-to-buy-and-sell-stock.py) |

| [122. 买卖股票的最佳时机 II](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-ii/) | 简单 | [python](https://github.com/Neulana/leetcode/blob/master/array/best-time-to-buy-and-sell-stock-ii.py) |

| [125. 验证回文串](https://leetcode-cn.com/problems/valid-palindrome/) | 简单 | [python](https://github.com/Neulana/leetcode/blob/master/string/valid-palindrome.py) |

| [136. 只出现一次的数字](https://leetcode-cn.com/problems/single-number/) | 简单 | [python](https://github.com/Neulana/leetcode/blob/master/bit-manipulation/single-number.py) |

| [141. 环形链表](https://leetcode-cn.com/problems/linked-list-cycle/) | 简单 | [python](https://github.com/Neulana/leetcode/blob/master/linkedlist/linked-list-cycle.py) |

| [155. 最小栈](https://leetcode-cn.com/problems/min-stack/)   | 简单 | [python](https://github.com/Neulana/leetcode/blob/master/stack/min-stack.py) |

| [160. 相交链表](https://leetcode-cn.com/problems/intersection-of-two-linked-lists/) | 简单 | [python](https://github.com/Neulana/leetcode/blob/master/linkedlist/intersection-of-two-linked-lists.py) |

| [167. 两数之和 II - 输入有序数组](https://leetcode-cn.com/problems/two-sum-ii-input-array-is-sorted/) | 简单 | [python](https://github.com/Neulana/leetcode/blob/master/array/two-sum-ii-input-array-is-sorted.py) |

| [168. Excel表列名称](https://leetcode-cn.com/problems/excel-sheet-column-title/) | 简单 | [python](https://github.com/Neulana/leetcode/blob/master/mathematics/excel-sheet-column-title.py) |

| [169. 求众数](https://leetcode-cn.com/problems/majority-element/) | 简单 | [python](https://leetcode-cn.com/problems/majority-element/) |

| [171. Excel表列序号](https://leetcode-cn.com/problems/excel-sheet-column-number/) | 简单 | [python](https://github.com/Neulana/leetcode/blob/master/mathematics/excel-sheet-column-number.py) |

| [172. 阶乘后的零](https://leetcode-cn.com/problems/factorial-trailing-zeroes/) | 简单 | [python](https://github.com/Neulana/leetcode/blob/master/mathematics/factorial-trailing-zeroes.py) |

| [175. 组合两个表](https://leetcode-cn.com/problems/combine-two-tables/) | 简单 | [sql](https://github.com/Neulana/leetcode/blob/master/SQL/combine-two-tables.sql) |

| [176. 第二高的薪水](https://leetcode-cn.com/problems/second-highest-salary/) | 简单 | [sql](https://github.com/Neulana/leetcode/blob/master/SQL/second-highest-salary.sql) |

| [181. 超过经理收入的员工](https://leetcode-cn.com/problems/employees-earning-more-than-their-managers/) | 简单 | [sql](https://github.com/Neulana/leetcode/blob/master/SQL/employees-earning-more-than-their-managers.sql) |

| [182. 查找重复的电子邮箱](https://leetcode-cn.com/problems/duplicate-emails/) | 简单 | [sql](https://github.com/Neulana/leetcode/blob/master/SQL/duplicate-email.sql) |

| [183. 从不订购的客户](https://leetcode-cn.com/problems/customers-who-never-order/) | 简单 | [sql](https://github.com/Neulana/leetcode/blob/master/SQL/customers-who-never-order.sql) |

| [189. 旋转数组](https://leetcode-cn.com/problems/rotate-array/) | 简单 | [python](https://github.com/Neulana/leetcode/blob/master/array/rotate-array.py) |

| [190. 颠倒二进制位](https://leetcode-cn.com/problems/reverse-bits/) | 简单 | [python](https://github.com/Neulana/leetcode/blob/master/bit-manipulation/reverse-bits.py) |

| [191. 位1的个数](https://leetcode-cn.com/problems/number-of-1-bits/) | 简单 | [python](https://github.com/Neulana/leetcode/blob/master/bit-manipulation/number-of-1-bits.py) |

| [193. 有效电话号码](https://leetcode-cn.com/problems/valid-phone-numbers/) | 简单 | [shell](https://github.com/Neulana/leetcode/blob/master/shell/valid-phone-numbers.sh) |

| [195. 第十行](https://leetcode-cn.com/problems/tenth-line/)  | 简单 | [shell](https://github.com/Neulana/leetcode/blob/master/shell/tenth-line.sh) |

| [196. 删除重复的电子邮箱](https://leetcode-cn.com/problems/delete-duplicate-emails/) | 简单 | [sql](https://github.com/Neulana/leetcode/blob/master/SQL/delete-duplicate-emails.sql) |

| [197. 上升的温度](https://leetcode-cn.com/problems/rising-temperature/) | 简单 | [sql](https://github.com/Neulana/leetcode/blob/master/SQL/rising-temperature.sql) |

| [198. 打家劫舍](https://leetcode-cn.com/problems/house-robber/) | 简单 | [python](https://github.com/Neulana/leetcode/blob/master/dp/house-robber.py) |

| [202. 快乐数](https://leetcode-cn.com/problems/happy-number/) | 简单 | [python](https://github.com/Neulana/leetcode/blob/master/mathematics/happy-number.py) |

| [203. 移除链表元素](https://leetcode-cn.com/problems/remove-linked-list-elements/) | 简单 | [python](https://github.com/Neulana/leetcode/blob/master/linkedlist/remove-linked-list-elements.py) |

| [204. 计数质数](https://leetcode-cn.com/problems/count-primes/) | 简单 | [python](https://github.com/Neulana/leetcode/blob/master/mathematics/count-primes.py) |

| [215. 数组中的第K个最大元素](https://leetcode-cn.com/problems/kth-largest-element-in-an-array/) | 中等 | [python](https://github.com/Neulana/leetcode/blob/master/dp/kth-largest-element-in-an-array.py) |

|                                                              |      |                                                              |