commit by crawler.py @netcan at 2019-03-12 00:02

Author: netcan

.gitignore

@@ -1,2 +1,3 @@
 .idea
 __pycache__
+/leetcode.sqlite

1019. Squares of a Sorted Array/README.md

@@ -0,0 +1,20 @@
+
+### Squares of a Sorted Array :star:
+- 题目地址/Problem Url: [https://leetcode-cn.com/problems/squares-of-a-sorted-array](https://leetcode-cn.com/problems/squares-of-a-sorted-array)
+- 执行时间/Runtime: 16 ms 
+- 内存消耗/Mem Usage: 3.1 MB
+- 通过日期/Accept Datetime: 2019-03-11 22:29
+
+```rust
+// Author: Netcan @ https://github.com/netcan/Leetcode-Rust
+// Zhihu: https://www.zhihu.com/people/netcan
+
+impl Solution {
+    pub fn sorted_squares(a: Vec<i32>) -> Vec<i32> {
+        let mut a = a.iter().map(|&x| x * x).collect::<Vec<i32>>();
+        a.sort();
+        a
+    }
+}
+
+```

1019. Squares of a Sorted Array/main.rs

@@ -0,0 +1,10 @@
+// Author: Netcan @ https://github.com/netcan/Leetcode-Rust
+// Zhihu: https://www.zhihu.com/people/netcan
+
+impl Solution {
+    pub fn sorted_squares(a: Vec<i32>) -> Vec<i32> {
+        let mut a = a.iter().map(|&x| x * x).collect::<Vec<i32>>();
+        a.sort();
+        a
+    }
+}

1037. Minimum Number of K Consecutive Bit Flips/README.md

@@ -0,0 +1,62 @@
+
+### Minimum Number of K Consecutive Bit Flips :star::star::star:
+- 题目地址/Problem Url: [https://leetcode-cn.com/problems/minimum-number-of-k-consecutive-bit-flips](https://leetcode-cn.com/problems/minimum-number-of-k-consecutive-bit-flips)
+- 执行时间/Runtime: 20 ms 
+- 内存消耗/Mem Usage: 3.5 MB
+- 通过日期/Accept Datetime: 2019-03-11 23:53
+
+```rust
+// Author: Netcan @ https://github.com/netcan/Leetcode-Rust
+// Zhihu: https://www.zhihu.com/people/netcan
+
+impl Solution {
+    pub fn min_k_bit_flips(a: Vec<i32>, k: i32) -> i32 {
+        let (mut sum, mut ans) = (0, 0);
+        // 是否翻转？
+        let mut flip = vec![0; a.len()];
+        for i in 0..a.len() - k as usize + 1 {
+            if (sum + a[i]) % 2 == 0 {
+                flip[i] = 1;
+                sum += flip[i];
+                ans += 1;
+            }
+
+            if i as i32 - k + 1 >= 0 {
+                sum -= flip[(i as i32 - k + 1) as usize]
+            }
+        }
+        // 检查后面部分，看看是否全部翻转成功
+        for i in a.len() - k as usize + 1..a.len() {
+            if (sum + a[i]) % 2 == 0 {
+                return -1;
+            }
+            if i as i32 - k + 1 >= 0 {
+                sum -= flip[(i as i32 - k + 1) as usize]
+            }
+        }
+        ans
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+    #[test]
+    fn test_1() {
+        assert_eq!(Solution::min_k_bit_flips(vec![1, 1, 0], 3), -1);
+    }
+    #[test]
+    fn test_2() {
+        assert_eq!(Solution::min_k_bit_flips(vec![0,0,0,1,0,1,1,0], 3), 3);
+    }
+    #[test]
+    fn test_3() {
+        assert_eq!(Solution::min_k_bit_flips(vec![0, 1, 1], 2), -1);
+    }
+    #[test]
+    fn test_4() {
+        assert_eq!(Solution::min_k_bit_flips(vec![0, 1, 0], 1), 2);
+    }
+}
+
+```

1037. Minimum Number of K Consecutive Bit Flips/main.rs

@@ -0,0 +1,52 @@
+// Author: Netcan @ https://github.com/netcan/Leetcode-Rust
+// Zhihu: https://www.zhihu.com/people/netcan
+
+impl Solution {
+    pub fn min_k_bit_flips(a: Vec<i32>, k: i32) -> i32 {
+        let (mut sum, mut ans) = (0, 0);
+        // 是否翻转？
+        let mut flip = vec![0; a.len()];
+        for i in 0..a.len() - k as usize + 1 {
+            if (sum + a[i]) % 2 == 0 {
+                flip[i] = 1;
+                sum += flip[i];
+                ans += 1;
+            }
+
+            if i as i32 - k + 1 >= 0 {
+                sum -= flip[(i as i32 - k + 1) as usize]
+            }
+        }
+        // 检查后面部分，看看是否全部翻转成功
+        for i in a.len() - k as usize + 1..a.len() {
+            if (sum + a[i]) % 2 == 0 {
+                return -1;
+            }
+            if i as i32 - k + 1 >= 0 {
+                sum -= flip[(i as i32 - k + 1) as usize]
+            }
+        }
+        ans
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+    #[test]
+    fn test_1() {
+        assert_eq!(Solution::min_k_bit_flips(vec![1, 1, 0], 3), -1);
+    }
+    #[test]
+    fn test_2() {
+        assert_eq!(Solution::min_k_bit_flips(vec![0,0,0,1,0,1,1,0], 3), 3);
+    }
+    #[test]
+    fn test_3() {
+        assert_eq!(Solution::min_k_bit_flips(vec![0, 1, 1], 2), -1);
+    }
+    #[test]
+    fn test_4() {
+        assert_eq!(Solution::min_k_bit_flips(vec![0, 1, 0], 1), 2);
+    }
+}

111. Minimum Depth of Binary Tree/README.md

@@ -3,7 +3,7 @@
 - 题目地址/Problem Url: [https://leetcode-cn.com/problems/minimum-depth-of-binary-tree](https://leetcode-cn.com/problems/minimum-depth-of-binary-tree)
 - 执行时间/Runtime: 4 ms 
 - 内存消耗/Mem Usage: 3.2 MB
-- 提交日期/Datetime: 2019-03-08 17:55
+- 通过日期/Accept Datetime: 2019-03-08 17:55
 
 ```rust
 // Author: Netcan @ https://github.com/netcan/Leetcode-Rust

112. Path Sum/README.md

@@ -3,7 +3,7 @@
 - 题目地址/Problem Url: [https://leetcode-cn.com/problems/path-sum](https://leetcode-cn.com/problems/path-sum)
 - 执行时间/Runtime: 4 ms 
 - 内存消耗/Mem Usage: 3.1 MB
-- 提交日期/Datetime: 2019-03-10 00:06
+- 通过日期/Accept Datetime: 2019-03-10 00:06
 
 ```rust
 // Author: Netcan @ https://github.com/netcan/Leetcode-Rust

113. Path Sum II/README.md

@@ -3,7 +3,7 @@
 - 题目地址/Problem Url: [https://leetcode-cn.com/problems/path-sum-ii](https://leetcode-cn.com/problems/path-sum-ii)
 - 执行时间/Runtime: 4 ms 
 - 内存消耗/Mem Usage: 6.7 MB
-- 提交日期/Datetime: 2019-03-10 00:48
+- 通过日期/Accept Datetime: 2019-03-10 00:48
 
 ```rust
 // Author: Netcan @ https://github.com/netcan/Leetcode-Rust

124. Binary Tree Maximum Path Sum/README.md

@@ -3,7 +3,7 @@
 - 题目地址/Problem Url: [https://leetcode-cn.com/problems/binary-tree-maximum-path-sum](https://leetcode-cn.com/problems/binary-tree-maximum-path-sum)
 - 执行时间/Runtime: 8 ms 
 - 内存消耗/Mem Usage: 4.5 MB
-- 提交日期/Datetime: 2019-03-09 23:40
+- 通过日期/Accept Datetime: 2019-03-09 23:40
 
 ```rust
 // Author: Netcan @ https://github.com/netcan/Leetcode-Rust

129. Sum Root to Leaf Numbers/README.md

@@ -3,7 +3,7 @@
 - 题目地址/Problem Url: [https://leetcode-cn.com/problems/sum-root-to-leaf-numbers](https://leetcode-cn.com/problems/sum-root-to-leaf-numbers)
 - 执行时间/Runtime: 0 ms 
 - 内存消耗/Mem Usage: 2.5 MB
-- 提交日期/Datetime: 2019-03-10 00:17
+- 通过日期/Accept Datetime: 2019-03-10 00:17
 
 ```rust
 // Author: Netcan @ https://github.com/netcan/Leetcode-Rust

135. Candy/README.md

@@ -3,7 +3,7 @@
 - 题目地址/Problem Url: [https://leetcode-cn.com/problems/candy](https://leetcode-cn.com/problems/candy)
 - 执行时间/Runtime: 16 ms 
 - 内存消耗/Mem Usage: 3.5 MB
-- 提交日期/Datetime: 2019-03-11 21:47
+- 通过日期/Accept Datetime: 2019-03-11 21:47
 
 ```rust
 // Author: Netcan @ https://github.com/netcan/Leetcode-Rust

136. Single Number/README.md

@@ -3,7 +3,7 @@
 - 题目地址/Problem Url: [https://leetcode-cn.com/problems/single-number](https://leetcode-cn.com/problems/single-number)
 - 执行时间/Runtime: 0 ms 
 - 内存消耗/Mem Usage: 2.7 MB
-- 提交日期/Datetime: 2019-03-10 01:06
+- 通过日期/Accept Datetime: 2019-03-10 01:06
 
 ```rust
 // Author: Netcan @ https://github.com/netcan/Leetcode-Rust

144. Binary Tree Preorder Traversal/README.md

@@ -3,7 +3,7 @@
 - 题目地址/Problem Url: [https://leetcode-cn.com/problems/binary-tree-preorder-traversal](https://leetcode-cn.com/problems/binary-tree-preorder-traversal)
 - 执行时间/Runtime: 0 ms 
 - 内存消耗/Mem Usage: 712.7 KB
-- 提交日期/Datetime: 2019-02-19 20:46
+- 通过日期/Accept Datetime: 2019-02-19 20:46
 
 ```rust
 // Author: Netcan @ https://github.com/netcan/Leetcode-Rust

145. Binary Tree Postorder Traversal/README.md

@@ -3,7 +3,7 @@
 - 题目地址/Problem Url: [https://leetcode-cn.com/problems/binary-tree-postorder-traversal](https://leetcode-cn.com/problems/binary-tree-postorder-traversal)
 - 执行时间/Runtime: 0 ms 
 - 内存消耗/Mem Usage: 708.6 KB
-- 提交日期/Datetime: 2019-02-19 20:47
+- 通过日期/Accept Datetime: 2019-02-19 20:47
 
 ```rust
 // Author: Netcan @ https://github.com/netcan/Leetcode-Rust

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

@@ -3,7 +3,7 @@
 - 题目地址/Problem Url: [https://leetcode-cn.com/problems/letter-combinations-of-a-phone-number](https://leetcode-cn.com/problems/letter-combinations-of-a-phone-number)
 - 执行时间/Runtime: 0 ms 
 - 内存消耗/Mem Usage: 745.5 KB
-- 提交日期/Datetime: 2019-02-19 19:37
+- 通过日期/Accept Datetime: 2019-02-19 19:37
 
 ```rust
 // Author: Netcan @ https://github.com/netcan/Leetcode-Rust

200. Number of Islands/README.md

@@ -3,7 +3,7 @@
 - 题目地址/Problem Url: [https://leetcode-cn.com/problems/number-of-islands](https://leetcode-cn.com/problems/number-of-islands)
 - 执行时间/Runtime: 8 ms 
 - 内存消耗/Mem Usage: 4.6 MB
-- 提交日期/Datetime: 2019-03-11 15:21
+- 通过日期/Accept Datetime: 2019-03-11 15:21
 
 ```rust
 // Author: Netcan @ https://github.com/netcan/Leetcode-Rust

201. Bitwise AND of Numbers Range/README.md

@@ -3,7 +3,7 @@
 - 题目地址/Problem Url: [https://leetcode-cn.com/problems/bitwise-and-of-numbers-range](https://leetcode-cn.com/problems/bitwise-and-of-numbers-range)
 - 执行时间/Runtime: 24 ms 
 - 内存消耗/Mem Usage: 2.3 MB
-- 提交日期/Datetime: 2019-03-07 12:05
+- 通过日期/Accept Datetime: 2019-03-07 12:05
 
 ```rust
 // Author: Netcan @ https://github.com/netcan/Leetcode-Rust

257. Binary Tree Paths/README.md

@@ -3,7 +3,7 @@
 - 题目地址/Problem Url: [https://leetcode-cn.com/problems/binary-tree-paths](https://leetcode-cn.com/problems/binary-tree-paths)
 - 执行时间/Runtime: 0 ms 
 - 内存消耗/Mem Usage: 2.5 MB
-- 提交日期/Datetime: 2019-03-06 23:17
+- 通过日期/Accept Datetime: 2019-03-06 23:17
 
 ```rust
 // Author: Netcan @ https://github.com/netcan/Leetcode-Rust

295. Find Median from Data Stream/README.md

@@ -3,7 +3,7 @@
 - 题目地址/Problem Url: [https://leetcode-cn.com/problems/find-median-from-data-stream](https://leetcode-cn.com/problems/find-median-from-data-stream)
 - 执行时间/Runtime: 2056 ms 
 - 内存消耗/Mem Usage: 9.5 MB
-- 提交日期/Datetime: 2019-03-07 20:11
+- 通过日期/Accept Datetime: 2019-03-07 20:11
 
 ```rust
 // Author: Netcan @ https://github.com/netcan/Leetcode-Rust

343. Integer Break/README.md

@@ -3,7 +3,7 @@
 - 题目地址/Problem Url: [https://leetcode-cn.com/problems/integer-break](https://leetcode-cn.com/problems/integer-break)
 - 执行时间/Runtime: 0 ms 
 - 内存消耗/Mem Usage: 2.4 MB
-- 提交日期/Datetime: 2019-03-07 15:06
+- 通过日期/Accept Datetime: 2019-03-07 15:06
 
 ```rust
 // Author: Netcan @ https://github.com/netcan/Leetcode-Rust

349. Intersection of Two Arrays/README.md

@@ -3,7 +3,7 @@
 - 题目地址/Problem Url: [https://leetcode-cn.com/problems/intersection-of-two-arrays](https://leetcode-cn.com/problems/intersection-of-two-arrays)
 - 执行时间/Runtime: 0 ms 
 - 内存消耗/Mem Usage: 2.5 MB
-- 提交日期/Datetime: 2019-03-08 11:43
+- 通过日期/Accept Datetime: 2019-03-08 11:43
 
 ```rust
 // Author: Netcan @ https://github.com/netcan/Leetcode-Rust

363. Max Sum of Rectangle No Larger Than K/README.md

@@ -3,7 +3,7 @@
 - 题目地址/Problem Url: [https://leetcode-cn.com/problems/max-sum-of-rectangle-no-larger-than-k](https://leetcode-cn.com/problems/max-sum-of-rectangle-no-larger-than-k)
 - 执行时间/Runtime: 496 ms 
 - 内存消耗/Mem Usage: 2.9 MB
-- 提交日期/Datetime: 2019-03-06 14:28
+- 通过日期/Accept Datetime: 2019-03-06 14:28
 
 ```rust
 // Author: Netcan @ https://github.com/netcan/Leetcode-Rust

405. Convert a Number to Hexadecimal/README.md

@@ -3,7 +3,7 @@
 - 题目地址/Problem Url: [https://leetcode-cn.com/problems/convert-a-number-to-hexadecimal](https://leetcode-cn.com/problems/convert-a-number-to-hexadecimal)
 - 执行时间/Runtime: 0 ms 
 - 内存消耗/Mem Usage: 2.3 MB
-- 提交日期/Datetime: 2019-03-06 09:52
+- 通过日期/Accept Datetime: 2019-03-06 09:52
 
 ```rust
 // Author: Netcan @ https://github.com/netcan/Leetcode-Rust

437. Path Sum III/README.md

@@ -3,7 +3,7 @@
 - 题目地址/Problem Url: [https://leetcode-cn.com/problems/path-sum-iii](https://leetcode-cn.com/problems/path-sum-iii)
 - 执行时间/Runtime: 20 ms 
 - 内存消耗/Mem Usage: 2.8 MB
-- 提交日期/Datetime: 2019-03-10 00:38
+- 通过日期/Accept Datetime: 2019-03-10 00:38
 
 ```rust
 // Author: Netcan @ https://github.com/netcan/Leetcode-Rust

443. String Compression/README.md

@@ -3,7 +3,7 @@
 - 题目地址/Problem Url: [https://leetcode-cn.com/problems/string-compression](https://leetcode-cn.com/problems/string-compression)
 - 执行时间/Runtime: 8 ms 
 - 内存消耗/Mem Usage: 2.5 MB
-- 提交日期/Datetime: 2019-03-06 16:03
+- 通过日期/Accept Datetime: 2019-03-06 16:03
 
 ```rust
 // Author: Netcan @ https://github.com/netcan/Leetcode-Rust

455. Assign Cookies/README.md

@@ -3,7 +3,7 @@
 - 题目地址/Problem Url: [https://leetcode-cn.com/problems/assign-cookies](https://leetcode-cn.com/problems/assign-cookies)
 - 执行时间/Runtime: 12 ms 
 - 内存消耗/Mem Usage: 3.1 MB
-- 提交日期/Datetime: 2019-03-05 20:22
+- 通过日期/Accept Datetime: 2019-03-05 20:22
 
 ```rust
 // Author: Netcan @ https://github.com/netcan/Leetcode-Rust

461. Hamming Distance/README.md

@@ -3,7 +3,7 @@
 - 题目地址/Problem Url: [https://leetcode-cn.com/problems/hamming-distance](https://leetcode-cn.com/problems/hamming-distance)
 - 执行时间/Runtime: 0 ms 
 - 内存消耗/Mem Usage: 2.4 MB
-- 提交日期/Datetime: 2019-03-08 14:38
+- 通过日期/Accept Datetime: 2019-03-08 14:38
 
 ```rust
 // Author: Netcan @ https://github.com/netcan/Leetcode-Rust

463. Island Perimeter/README.md

@@ -3,7 +3,7 @@
 - 题目地址/Problem Url: [https://leetcode-cn.com/problems/island-perimeter](https://leetcode-cn.com/problems/island-perimeter)
 - 执行时间/Runtime: 32 ms 
 - 内存消耗/Mem Usage: 3 MB
-- 提交日期/Datetime: 2019-03-11 15:50
+- 通过日期/Accept Datetime: 2019-03-11 15:50
 
 ```rust
 // Author: Netcan @ https://github.com/netcan/Leetcode-Rust

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

@@ -3,7 +3,7 @@
 - 题目地址/Problem Url: [https://leetcode-cn.com/problems/powx-n](https://leetcode-cn.com/problems/powx-n)
 - 执行时间/Runtime: 0 ms 
 - 内存消耗/Mem Usage: 2.4 MB
-- 提交日期/Datetime: 2019-03-10 23:16
+- 通过日期/Accept Datetime: 2019-03-10 23:16
 
 ```rust
 // Author: Netcan @ https://github.com/netcan/Leetcode-Rust

51. N-Queens/README.md

@@ -3,7 +3,7 @@
 - 题目地址/Problem Url: [https://leetcode-cn.com/problems/n-queens](https://leetcode-cn.com/problems/n-queens)
 - 执行时间/Runtime: 8 ms 
 - 内存消耗/Mem Usage: 2.6 MB
-- 提交日期/Datetime: 2019-03-10 12:57
+- 通过日期/Accept Datetime: 2019-03-10 12:57
 
 ```rust
 // Author: Netcan @ https://github.com/netcan/Leetcode-Rust

52. N-Queens II/README.md

@@ -3,7 +3,7 @@
 - 题目地址/Problem Url: [https://leetcode-cn.com/problems/n-queens-ii](https://leetcode-cn.com/problems/n-queens-ii)
 - 执行时间/Runtime: 12 ms 
 - 内存消耗/Mem Usage: 2.3 MB
-- 提交日期/Datetime: 2019-03-10 12:44
+- 通过日期/Accept Datetime: 2019-03-10 12:44
 
 ```rust
 // Author: Netcan @ https://github.com/netcan/Leetcode-Rust

539. Minimum Time Difference/README.md

@@ -3,7 +3,7 @@
 - 题目地址/Problem Url: [https://leetcode-cn.com/problems/minimum-time-difference](https://leetcode-cn.com/problems/minimum-time-difference)
 - 执行时间/Runtime: 4 ms 
 - 内存消耗/Mem Usage: 3.4 MB
-- 提交日期/Datetime: 2019-03-07 18:50
+- 通过日期/Accept Datetime: 2019-03-07 18:50
 
 ```rust
 // Author: Netcan @ https://github.com/netcan/Leetcode-Rust