commit by crawler.py @netcan at 2019-04-05 00:27

Author: netcan

README.md

@@ -4,7 +4,7 @@
 
 本项目由`crawler.py`生成，代码自动爬取Leetcode-cn.com网站获取个人提交记录。使用方法：登陆Leetcode后记录cookie，设置环境变量`LEETCODE_COOKIE`，然后执行本脚本就能抓取指定语言的个人提交记录。
 
-目前已解决的题目（100 个，其中简单31 个，中等46 个， 困难23 个）：
+目前已解决的题目（105 个，其中简单31 个，中等50 个， 困难24 个）：
 - [4. Median of Two Sorted Arrays :star::star::star:](https://github.com/netcan/Leetcode-Rust/tree/master/n0004.%20Median%20of%20Two%20Sorted%20Arrays)
 - [8. String to Integer (atoi) :star::star:](https://github.com/netcan/Leetcode-Rust/tree/master/n0008.%20String%20to%20Integer%20(atoi))
 - [17. Letter Combinations of a Phone Number :star::star:](https://github.com/netcan/Leetcode-Rust/tree/master/n0017.%20Letter%20Combinations%20of%20a%20Phone%20Number)
@@ -43,6 +43,7 @@
 - [300. Longest Increasing Subsequence :star::star:](https://github.com/netcan/Leetcode-Rust/tree/master/n0300.%20Longest%20Increasing%20Subsequence)
 - [312. Burst Balloons :star::star::star:](https://github.com/netcan/Leetcode-Rust/tree/master/n0312.%20Burst%20Balloons)
 - [315. Count of Smaller Numbers After Self :star::star::star:](https://github.com/netcan/Leetcode-Rust/tree/master/n0315.%20Count%20of%20Smaller%20Numbers%20After%20Self)
+- [322. Coin Change :star::star:](https://github.com/netcan/Leetcode-Rust/tree/master/n0322.%20Coin%20Change)
 - [327. Count of Range Sum :star::star::star:](https://github.com/netcan/Leetcode-Rust/tree/master/n0327.%20Count%20of%20Range%20Sum)
 - [334. Increasing Triplet Subsequence :star::star:](https://github.com/netcan/Leetcode-Rust/tree/master/n0334.%20Increasing%20Triplet%20Subsequence)
 - [337. House Robber III :star::star:](https://github.com/netcan/Leetcode-Rust/tree/master/n0337.%20House%20Robber%20III)
@@ -60,6 +61,8 @@
 - [455. Assign Cookies :star:](https://github.com/netcan/Leetcode-Rust/tree/master/n0455.%20Assign%20Cookies)
 - [461. Hamming Distance :star:](https://github.com/netcan/Leetcode-Rust/tree/master/n0461.%20Hamming%20Distance)
 - [463. Island Perimeter :star:](https://github.com/netcan/Leetcode-Rust/tree/master/n0463.%20Island%20Perimeter)
+- [514. Freedom Trail :star::star::star:](https://github.com/netcan/Leetcode-Rust/tree/master/n0514.%20Freedom%20Trail)
+- [518. Coin Change 2 :star::star:](https://github.com/netcan/Leetcode-Rust/tree/master/n0518.%20Coin%20Change%202)
 - [539. Minimum Time Difference :star::star:](https://github.com/netcan/Leetcode-Rust/tree/master/n0539.%20Minimum%20Time%20Difference)
 - [563. Binary Tree Tilt :star:](https://github.com/netcan/Leetcode-Rust/tree/master/n0563.%20Binary%20Tree%20Tilt)
 - [583. Delete Operation for Two Strings :star::star:](https://github.com/netcan/Leetcode-Rust/tree/master/n0583.%20Delete%20Operation%20for%20Two%20Strings)
@@ -75,6 +78,7 @@
 - [699. Falling Squares :star::star::star:](https://github.com/netcan/Leetcode-Rust/tree/master/n0699.%20Falling%20Squares)
 - [728. Self Dividing Numbers :star:](https://github.com/netcan/Leetcode-Rust/tree/master/n0728.%20Self%20Dividing%20Numbers)
 - [744. Find Smallest Letter Greater Than Target :star:](https://github.com/netcan/Leetcode-Rust/tree/master/n0744.%20Find%20Smallest%20Letter%20Greater%20Than%20Target)
+- [787. Cheapest Flights Within K Stops :star::star:](https://github.com/netcan/Leetcode-Rust/tree/master/n0787.%20Cheapest%20Flights%20Within%20K%20Stops)
 - [792. Number of Matching Subsequences :star::star:](https://github.com/netcan/Leetcode-Rust/tree/master/n0792.%20Number%20of%20Matching%20Subsequences)
 - [836. Rectangle Overlap :star:](https://github.com/netcan/Leetcode-Rust/tree/master/n0836.%20Rectangle%20Overlap)
 - [861. Score After Flipping Matrix :star::star:](https://github.com/netcan/Leetcode-Rust/tree/master/n0861.%20Score%20After%20Flipping%20Matrix)
@@ -86,6 +90,7 @@
 - [977. Squares of a Sorted Array :star:](https://github.com/netcan/Leetcode-Rust/tree/master/n0977.%20Squares%20of%20a%20Sorted%20Array)
 - [980. Unique Paths III :star::star::star:](https://github.com/netcan/Leetcode-Rust/tree/master/n0980.%20Unique%20Paths%20III)
 - [982. Triples with Bitwise AND Equal To Zero :star::star::star:](https://github.com/netcan/Leetcode-Rust/tree/master/n0982.%20Triples%20with%20Bitwise%20AND%20Equal%20To%20Zero)
+- [983. Minimum Cost For Tickets :star::star:](https://github.com/netcan/Leetcode-Rust/tree/master/n0983.%20Minimum%20Cost%20For%20Tickets)
 - [991. Broken Calculator :star::star:](https://github.com/netcan/Leetcode-Rust/tree/master/n0991.%20Broken%20Calculator)
 - [995. Minimum Number of K Consecutive Bit Flips :star::star::star:](https://github.com/netcan/Leetcode-Rust/tree/master/n0995.%20Minimum%20Number%20of%20K%20Consecutive%20Bit%20Flips)
 - [1000. Minimum Cost to Merge Stones :star::star::star:](https://github.com/netcan/Leetcode-Rust/tree/master/n1000.%20Minimum%20Cost%20to%20Merge%20Stones)

crawler.py

@@ -35,13 +35,14 @@
 - 通过日期: {time}
 
 ### 题目内容
+---
 {question_content}
 
 ### 解法
+---
 ```{lang}
 {code}
-```
-"""
+```"""
 
 class Leetcode:
     LEETCODE_URL = 'https://leetcode-cn.com'
@@ -150,7 +151,9 @@ def process_submit_list(question_):
                 if not thread.is_alive():
                     threads.remove(thread)
 
-    def generate_readme(self):
+        self.__generate_readme()
+
+    def __generate_readme(self):
         pattern_name = re.compile('n(\d+)\. (.*)')
         question_level = {
             1: 0, 2: 0, 3: 0
@@ -186,7 +189,6 @@ def generate_readme(self):
     lc = Leetcode()
 
     lc.output_source()
-    lc.generate_readme()
 
     subprocess.run(["git", "add", "."])
     subprocess.run(["git", "commit", "-m", "commit by crawler.py @Netcan at {}".format(datetime.now().strftime("%Y-%m-%d %H:%M"))])

n0004. Median of Two Sorted Arrays/README.md

@@ -5,6 +5,7 @@
 - 通过日期: 2019-03-17 16:56
 
 ### 题目内容
+---
 <p>给定两个大小为 m 和 n 的有序数组 <code>nums1</code> 和 <code>nums2</code>。</p>
 
 <p>请你找出这两个有序数组的中位数，并且要求算法的时间复杂度为 O(log(m + n))。</p>
@@ -29,6 +30,7 @@ nums2 = [3, 4]
 
 
 ### 解法
+---
 ```rust
 // Author: Netcan @ https://github.com/netcan/Leetcode-Rust
 // Zhihu: https://www.zhihu.com/people/netcan
@@ -61,4 +63,4 @@ impl Solution {
     }
 }
 
-```
+```

n0008. String to Integer (atoi)/README.md

@@ -5,6 +5,7 @@
 - 通过日期: 2019-02-18 18:00
 
 ### 题目内容
+---
 <p>请你来实现一个 <code>atoi</code> 函数，使其能将字符串转换成整数。</p>
 
 <p>首先，该函数会根据需要丢弃无用的开头空格字符，直到寻找到第一个非空格的字符为止。</p>
@@ -59,6 +60,7 @@
 
 
 ### 解法
+---
 ```rust
 // Author: Netcan @ https://github.com/netcan/Leetcode-Rust
 // Zhihu: https://www.zhihu.com/people/netcan
@@ -111,4 +113,4 @@ impl Solution {
 }
 
 
-```
+```

n0017. Letter Combinations of a Phone Number/README.md

@@ -5,6 +5,7 @@
 - 通过日期: 2019-02-19 19:37
 
 ### 题目内容
+---
 <p>给定一个仅包含数字 <code>2-9</code> 的字符串，返回所有它能表示的字母组合。</p>
 
 <p>给出数字到字母的映射如下（与电话按键相同）。注意 1 不对应任何字母。</p>
@@ -22,6 +23,7 @@
 
 
 ### 解法
+---
 ```rust
 // Author: Netcan @ https://github.com/netcan/Leetcode-Rust
 // Zhihu: https://www.zhihu.com/people/netcan
@@ -66,4 +68,4 @@ impl Solution {
 }
 
 
-```
+```

n0036. Valid Sudoku/README.md

@@ -5,6 +5,7 @@
 - 通过日期: 2019-03-17 09:56
 
 ### 题目内容
+---
 <p>判断一个 9x9 的数独是否有效。只需要<strong>根据以下规则</strong>，验证已经填入的数字是否有效即可。</p>
 
 <ol>
@@ -65,6 +66,7 @@
 
 
 ### 解法
+---
 ```rust
 // Author: Netcan @ https://github.com/netcan/Leetcode-Rust
 // Zhihu: https://www.zhihu.com/people/netcan
@@ -99,4 +101,4 @@ impl Solution {
     }
 }
 
-```
+```

n0037. Sudoku Solver/README.md

@@ -5,6 +5,7 @@
 - 通过日期: 2019-03-12 11:22
 
 ### 题目内容
+---
 <p>编写一个程序，通过已填充的空格来解决数独问题。</p>
 
 <p>一个数独的解法需<strong>遵循如下规则</strong>：</p>
@@ -35,6 +36,7 @@
 
 
 ### 解法
+---
 ```rust
 // Author: Netcan @ https://github.com/netcan/Leetcode-Rust
 // Zhihu: https://www.zhihu.com/people/netcan
@@ -103,4 +105,4 @@ impl Solution {
 }
 
 
-```
+```

n0050. Pow(x, n)/README.md

@@ -5,6 +5,7 @@
 - 通过日期: 2019-03-10 23:16
 
 ### 题目内容
+---
 <p>实现 <a href="https://www.cplusplus.com/reference/valarray/pow/" target="_blank">pow(<em>x</em>, <em>n</em>)</a> ，即计算 x 的 n 次幂函数。</p>
 
 <p><strong>示例 1:</strong></p>
@@ -34,6 +35,7 @@
 
 
 ### 解法
+---
 ```rust
 // Author: Netcan @ https://github.com/netcan/Leetcode-Rust
 // Zhihu: https://www.zhihu.com/people/netcan
@@ -66,4 +68,4 @@ mod tests {
     }
 }
 
-```
+```

n0051. N-Queens/README.md

@@ -5,6 +5,7 @@
 - 通过日期: 2019-03-10 12:57
 
 ### 题目内容
+---
 <p><em>n </em>皇后问题研究的是如何将 <em>n</em> 个皇后放置在 <em>n</em>×<em>n</em> 的棋盘上，并且使皇后彼此之间不能相互攻击。</p>
 
 <p><img src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2018/10/12/8-queens.png"></p>
@@ -34,6 +35,7 @@
 
 
 ### 解法
+---
 ```rust
 // Author: Netcan @ https://github.com/netcan/Leetcode-Rust
 // Zhihu: https://www.zhihu.com/people/netcan
@@ -88,4 +90,4 @@ impl Solution {
     }
 }
 
-```
+```

n0052. N-Queens II/README.md

@@ -5,6 +5,7 @@
 - 通过日期: 2019-03-10 12:44
 
 ### 题目内容
+---
 <p><em>n </em>皇后问题研究的是如何将 <em>n</em> 个皇后放置在 <em>n</em>×<em>n</em> 的棋盘上，并且使皇后彼此之间不能相互攻击。</p>
 
 <p><img src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2018/10/12/8-queens.png" style="height: 276px; width: 258px;"></p>
@@ -33,6 +34,7 @@
 
 
 ### 解法
+---
 ```rust
 // Author: Netcan @ https://github.com/netcan/Leetcode-Rust
 // Zhihu: https://www.zhihu.com/people/netcan
@@ -80,4 +82,4 @@ impl Solution {
     }
 }
 
-```
+```

n0058. Length of Last Word/README.md

@@ -5,6 +5,7 @@
 - 通过日期: 2019-03-05 19:11
 
 ### 题目内容
+---
 <p>给定一个仅包含大小写字母和空格 <code>' '</code> 的字符串，返回其最后一个单词的长度。</p>
 
 <p>如果不存在最后一个单词，请返回 0 。</p>
@@ -19,6 +20,7 @@
 
 
 ### 解法
+---
 ```rust
 // Author: Netcan @ https://github.com/netcan/Leetcode-Rust
 // Zhihu: https://www.zhihu.com/people/netcan
@@ -35,4 +37,4 @@ impl Solution {
 }
 
 
-```
+```

n0070. Climbing Stairs/README.md

@@ -5,6 +5,7 @@
 - 通过日期: 2019-03-05 19:27
 
 ### 题目内容
+---
 <p>假设你正在爬楼梯。需要 <em>n</em> 阶你才能到达楼顶。</p>
 
 <p>每次你可以爬 1 或 2 个台阶。你有多少种不同的方法可以爬到楼顶呢？</p>
@@ -31,6 +32,7 @@
 
 
 ### 解法
+---
 ```rust
 // Author: Netcan @ https://github.com/netcan/Leetcode-Rust
 // Zhihu: https://www.zhihu.com/people/netcan
@@ -48,4 +50,4 @@ impl Solution {
 }
 
 
-```
+```

n0071. Simplify Path/README.md

@@ -5,6 +5,7 @@
 - 通过日期: 2019-03-05 19:51
 
 ### 题目内容
+---
 <p>以 Unix 风格给出一个文件的<strong>绝对路径</strong>，你需要简化它。或者换句话说，将其转换为规范路径。</p>
 
 <p>在 Unix 风格的文件系统中，一个点（<code>.</code>）表示当前目录本身；此外，两个点 （<code>..</code>） 表示将目录切换到上一级（指向父目录）；两者都可以是复杂相对路径的组成部分。更多信息请参阅：<a href="https://blog.csdn.net/u011327334/article/details/50355600" target="_blank">Linux / Unix中的绝对路径 vs 相对路径</a></p>
@@ -53,6 +54,7 @@
 
 
 ### 解法
+---
 ```rust
 // Author: Netcan @ https://github.com/netcan/Leetcode-Rust
 // Zhihu: https://www.zhihu.com/people/netcan
@@ -112,4 +114,4 @@ mod tests {
 
 
 
-```
+```

n0072. Edit Distance/README.md

@@ -5,6 +5,7 @@
 - 通过日期: 2019-03-20 18:55
 
 ### 题目内容
+---
 <p>给定两个单词 <em>word1</em> 和 <em>word2</em>，计算出将 <em>word1</em> 转换成 <em>word2 </em>所使用的最少操作数 。</p>
 
 <p>你可以对一个单词进行如下三种操作：</p>
@@ -39,6 +40,7 @@ exection -> execution (插入 'u')
 
 
 ### 解法
+---
 ```rust
 // Author: Netcan @ https://github.com/netcan/Leetcode-Rust
 // Zhihu: https://www.zhihu.com/people/netcan
@@ -74,4 +76,4 @@ impl Solution {
 }
 
 
-```
+```

n0077. Combinations/README.md

@@ -5,6 +5,7 @@
 - 通过日期: 2019-02-18 16:39
 
 ### 题目内容
+---
 <p>给定两个整数 <em>n</em> 和 <em>k</em>，返回 1 ... <em>n </em>中所有可能的 <em>k</em> 个数的组合。</p>
 
 <p><strong>示例:</strong></p>
@@ -22,6 +23,7 @@
 
 
 ### 解法
+---
 ```rust
 // Author: Netcan @ https://github.com/netcan/Leetcode-Rust
 // Zhihu: https://www.zhihu.com/people/netcan
@@ -49,4 +51,4 @@ impl Solution {
 }
 
 
-```
+```

n0094. Binary Tree Inorder Traversal/README.md

@@ -5,6 +5,7 @@
 - 通过日期: 2019-02-19 20:44
 
 ### 题目内容
+---
 <p>给定一个二叉树，返回它的<em>中序 </em>遍历。</p>
 
 <p><strong>示例:</strong></p>
@@ -22,6 +23,7 @@
 
 
 ### 解法
+---
 ```rust
 // Author: Netcan @ https://github.com/netcan/Leetcode-Rust
 // Zhihu: https://www.zhihu.com/people/netcan
@@ -45,4 +47,4 @@ impl Solution {
 }
 
 
-```
+```