# LeetCode-Orust

**Repository Path**: orust/LeetCode-Orust

## Basic Information

- **Project Name**: LeetCode-Orust
- **Description**: Orust的每日力扣与力扣加加
- **Primary Language**: Unknown
- **License**: Not specified
- **Default Branch**: master
- **Homepage**: None
- **GVP Project**: No

## Statistics

- **Stars**: 0
- **Forks**: 0
- **Created**: 2020-07-05
- **Last Updated**: 2020-12-19

## Categories & Tags

**Categories**: Uncategorized

**Tags**: None

## README

# LeetCode-Orust
Orust的每日力扣与力扣加加

**链接直达**
1. [力扣主页](https://leetcode-cn.com/u/821218213/)     2. [题库链接](https://leetcode-cn.com/problemset/all/)      3. [91alg-1 问题列表](https://github.com/leetcode-pp/91alg-1/issues)      4. [在线Markdown](http://www.atoolbox.net/Category.php?Id=28)


# 简单
- [66.加一 [数组]](https://github.com/Liu821218213/LeetCode-Orust/blob/master/LeetCode%2B%2B/%E3%80%90Day%201%E3%80%91%202020-06-01%20-%2066.%20%E5%8A%A0%E4%B8%80%20%231.md)
- [206. 反转链表 [链表]](https://github.com/Liu821218213/LeetCode-Orust/blob/master/LeetCode%2B%2B/%E3%80%90Day%207%E3%80%91%202020-06-07%20-%20206.%20%E5%8F%8D%E8%BD%AC%E9%93%BE%E8%A1%A8%20%2324.md)
- [232. 用栈实现队列 [栈、设计、队列]](https://github.com/Liu821218213/LeetCode-Orust/blob/master/LeetCode%2B%2B/%E3%80%90Day%205%E3%80%91%202020-06-05%20-%20232.%20%E7%94%A8%E6%A0%88%E5%AE%9E%E7%8E%B0%E9%98%9F%E5%88%97.md)
- [1431.拥有最多糖果的孩子 [数组]](https://github.com/Liu821218213/LeetCode-Orust/blob/master/DailyLeetCode/2020%E5%B9%B46%E6%9C%88/1%231431.%E6%8B%A5%E6%9C%89%E6%9C%80%E5%A4%9A%E7%B3%96%E6%9E%9C%E7%9A%84%E5%AD%A9%E5%AD%90.md)


# 中等
- [75.颜色分类 [排序、数组、双指针]](https://github.com/Liu821218213/LeetCode-Orust/blob/master/LeetCode%2B%2B/%E3%80%90Day%202%E3%80%91%202020-06-02%20-%2075.%20%E9%A2%9C%E8%89%B2%E5%88%86%E7%B1%BB%20%2315.md)
- [109. 有序链表转换二叉搜索树 [深度优先搜索、链表、递归]](https://github.com/Liu821218213/LeetCode-Orust/blob/master/LeetCode%2B%2B/%E3%80%90Day%209%E3%80%91%202020-06-09%20-%20109.%20%E6%9C%89%E5%BA%8F%E9%93%BE%E8%A1%A8%E8%BD%AC%E6%8D%A2%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%20%2327.md)
- [238. 除自身以外数组的乘积 [数组、逆向]](https://github.com/Liu821218213/LeetCode-Orust/blob/master/DailyLeetCode/2020%E5%B9%B46%E6%9C%88/4%23238.%20%E9%99%A4%E8%87%AA%E8%BA%AB%E4%BB%A5%E5%A4%96%E6%95%B0%E7%BB%84%E7%9A%84%E4%B9%98%E7%A7%AF.md)
- [380. 常数时间插入、删除和获取随机元素 [设计、数组、哈希表]](https://github.com/Liu821218213/LeetCode-Orust/blob/master/LeetCode%2B%2B/%E3%80%90Day%206%E3%80%91%202020-06-06%20-%20380.%20%E5%B8%B8%E6%95%B0%E6%97%B6%E9%97%B4%E6%8F%92%E5%85%A5%E3%80%81%E5%88%A0%E9%99%A4%E5%92%8C%E8%8E%B7%E5%8F%96%E9%9A%8F%E6%9C%BA%E5%85%83%E7%B4%A0%20%2323.md)
- [394. 字符串解码 [栈、深度优先搜索]](https://github.com/Liu821218213/LeetCode-Orust/blob/master/LeetCode%2B%2B/%E3%80%90Day%204%E3%80%91%202020-06-04%20-%20394.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E8%A7%A3%E7%A0%81%20.md)
- [430. 扁平化多级双向链表 [深度优先搜索、链表]](https://github.com/Liu821218213/LeetCode-Orust/blob/master/LeetCode%2B%2B/%E3%80%90Day%208%E3%80%91%202020-06-07%20-%20430.%20%E6%89%81%E5%B9%B3%E5%8C%96%E5%A4%9A%E7%BA%A7%E5%8F%8C%E5%90%91%E9%93%BE%E8%A1%A8%20%2325.md)
- [837.新21点 [DP]](https://github.com/Liu821218213/LeetCode-Orust/blob/master/DailyLeetCode/2020%E5%B9%B46%E6%9C%88/3%23837.%E6%96%B021%E7%82%B9.md)
- [1381.设计一个支持增量操作的栈 [栈、设计]](https://github.com/Liu821218213/LeetCode-Orust/blob/master/LeetCode%2B%2B/%E3%80%90Day%203%E3%80%91%202020-06-03%20-%201381.%20%E8%AE%BE%E8%AE%A1%E4%B8%80%E4%B8%AA%E6%94%AF%E6%8C%81%E5%A2%9E%E9%87%8F%E6%93%8D%E4%BD%9C%E7%9A%84%E6%A0%88%20%2318.md)


# 困难
- [128. 最长连续序列 [并查集、数组]](https://github.com/Liu821218213/LeetCode-Orust/blob/master/DailyLeetCode/2020%E5%B9%B46%E6%9C%88/6%23128.%20%E6%9C%80%E9%95%BF%E8%BF%9E%E7%BB%AD%E5%BA%8F%E5%88%97.md)并查集并查集并查集并查集并查集并查集并查集并查集并查集并查集并查集并查集


# 面试题
- [64. 求1+2+…+n [递归、逻辑运算符]](https://github.com/Liu821218213/LeetCode-Orust/blob/master/DailyLeetCode/2020%E5%B9%B46%E6%9C%88/2%23%E9%9D%A2%E8%AF%95%E9%A2%9864.%20%E6%B1%821%2B2%2B%E2%80%A6%2Bn.md)
- [29.顺时针打印矩阵 [数组]](https://github.com/Liu821218213/LeetCode-Orust/blob/master/DailyLeetCode/2020%E5%B9%B46%E6%9C%88/5%23%E9%9D%A2%E8%AF%95%E9%A2%9829.%E9%A1%BA%E6%97%B6%E9%92%88%E6%89%93%E5%8D%B0%E7%9F%A9%E9%98%B5.md)

# 待解决题目
[126. 单词接龙 II](https://leetcode-cn.com/problems/word-ladder-ii/)