From 554d66f6a3157d4e427aef410741365d46b37130 Mon Sep 17 00:00:00 2001
From: HAOYUatHZ <haoyu@protonmail.com>
Date: Fri, 19 Jul 2019 20:14:52 +0800
Subject: [PATCH 01/25] init single-number-iii

---
 README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/README.md b/README.md
index 452182b..9a39431 100644
--- a/README.md
+++ b/README.md
@@ -54,10 +54,10 @@ cargo test
 0191  |[Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/number-of-1-bits.cpp), [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/number-of-1-bits.py) <br> [Rust](./kamyu104/src/number_of_1_bits.rs) | _O(1)_ | _O(1)_          | Easy           |||
 0201 | [Bitwise AND of Numbers Range](https://leetcode.com/problems/bitwise-and-of-numbers-range/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/bitwise-and-of-numbers-range.cpp), [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/bitwise-and-of-numbers-range.py) <br> [Rust](./kamyu104/src/bitwise_and_of_numbers_range.rs) | _O(1)_ | _O(1)_ | Medium ||
 0231 | [Power of Two](https://leetcode.com/problems/power-of-two/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/power-of-two.cpp), [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/power-of-two.py) <br> [Rust](./kamyu104/src/power_of_two.rs) | _O(1)_ | _O(1)_ | Easy | LintCode |
+0260 | [Single Number III](https://leetcode.com/problems/single-number-iii/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/single-number-iii.cpp), [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/single-number-iii.py) <br> [Rust](./kamyu104/src/single_number_iii.rs) | _O(n)_ | _O(1)_          | Medium         ||
 
 <!-- 
 
-0260 | [Single Number III](https://leetcode.com/problems/single-number-iii/) | [C++](./C++/single-number-iii.cpp) [Python](./Python/single-number-iii.py) | _O(n)_ | _O(1)_          | Medium         ||
 0268| [Missing Number](https://leetcode.com/problems/missing-number/) | [C++](./C++/missing-number.cpp) [Python](./Python/missing-number.py)  | _O(n)_ |  _O(1)_ | Medium         | LintCode ||
 0318| [Maximum Product of Word Lengths](https://leetcode.com/problems/maximum-product-of-word-lengths/) | [C++](./C++/maximum-product-of-word-lengths.cpp) [Python](./Python/maximum-product-of-word-lengths.py)  | _O(n)_ ~ _O(n^2)_ |  _O(n)_ | Medium         || Bit Manipulation, Counting Sort, Pruning|
 0342 | [Power of Four](https://leetcode.com/problems/power-of-four/) | [C++](./C++/power-of-four.cpp) [Python](./Python/power-of-four.py) | _O(1)_ | _O(1)_ | Easy | |

From 9c2ef2c019938e7bdac01a2157b429a88b34c518 Mon Sep 17 00:00:00 2001
From: HAOYUatHZ <haoyu@protonmail.com>
Date: Fri, 19 Jul 2019 20:16:00 +0800
Subject: [PATCH 02/25] update

---
 kamyu104/src/main.rs              |  1 +
 kamyu104/src/single_number_iii.rs | 18 ++++++++++++++++++
 2 files changed, 19 insertions(+)
 create mode 100644 kamyu104/src/single_number_iii.rs

diff --git a/kamyu104/src/main.rs b/kamyu104/src/main.rs
index 83e74a9..f6ffca0 100644
--- a/kamyu104/src/main.rs
+++ b/kamyu104/src/main.rs
@@ -4,4 +4,5 @@ mod power_of_two;
 mod reverse_bits;
 mod single_number;
 mod single_number_ii;
+mod single_number_iii;
 mod template;
diff --git a/kamyu104/src/single_number_iii.rs b/kamyu104/src/single_number_iii.rs
new file mode 100644
index 0000000..8f2e1c2
--- /dev/null
+++ b/kamyu104/src/single_number_iii.rs
@@ -0,0 +1,18 @@
+pub struct Solution {}
+impl Solution {
+    pub fn add(a: i32, b: i32) -> i32 {
+        println!("{}", a + b);
+        return a + b;
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    fn test_add() {
+        assert_eq!(Solution::add(1, 2), 3);
+        assert_ne!(Solution::add(1, 2), 4);
+    }
+}

From f956209bb4737eca936f6c5d84a2c8765da36ad6 Mon Sep 17 00:00:00 2001
From: HAOYUatHZ <haoyu@protonmail.com>
Date: Fri, 19 Jul 2019 20:21:16 +0800
Subject: [PATCH 03/25] init

---
 kamyu104/src/single_number_iii.rs | 10 ++++------
 1 file changed, 4 insertions(+), 6 deletions(-)

diff --git a/kamyu104/src/single_number_iii.rs b/kamyu104/src/single_number_iii.rs
index 8f2e1c2..7b921d4 100644
--- a/kamyu104/src/single_number_iii.rs
+++ b/kamyu104/src/single_number_iii.rs
@@ -1,8 +1,7 @@
 pub struct Solution {}
 impl Solution {
-    pub fn add(a: i32, b: i32) -> i32 {
-        println!("{}", a + b);
-        return a + b;
+    pub fn single_number(nums: Vec<i32>) -> Vec<i32> {
+        nums
     }
 }
 
@@ -11,8 +10,7 @@ mod tests {
     use super::*;
 
     #[test]
-    fn test_add() {
-        assert_eq!(Solution::add(1, 2), 3);
-        assert_ne!(Solution::add(1, 2), 4);
+    fn test_single_number() {
+        assert_eq!(Solution::single_number(vec![1,2,1,3,2,5]), vec![3,5]);
     }
 }

From 0e188cc42f204670bd6327ac7a5bfb48db7ad617 Mon Sep 17 00:00:00 2001
From: HAOYUatHZ <haoyu@protonmail.com>
Date: Sat, 20 Jul 2019 15:41:02 +0800
Subject: [PATCH 04/25] init sol for single_number_iii

---
 kamyu104/src/power_of_two.rs      |  2 --
 kamyu104/src/single_number_iii.rs | 13 +++++++++++--
 2 files changed, 11 insertions(+), 4 deletions(-)

diff --git a/kamyu104/src/power_of_two.rs b/kamyu104/src/power_of_two.rs
index 949187a..96048a7 100644
--- a/kamyu104/src/power_of_two.rs
+++ b/kamyu104/src/power_of_two.rs
@@ -15,7 +15,6 @@ impl Solution2 {
     }
 }
 
-
 #[cfg(test)]
 mod tests {
     // Note this useful idiom: importing names from outer (for mod tests) scope.
@@ -32,4 +31,3 @@ mod tests {
         assert_eq!(Solution2::is_power_of_two(218), false);
     }
 }
-
diff --git a/kamyu104/src/single_number_iii.rs b/kamyu104/src/single_number_iii.rs
index 7b921d4..d06896c 100644
--- a/kamyu104/src/single_number_iii.rs
+++ b/kamyu104/src/single_number_iii.rs
@@ -1,7 +1,16 @@
+// Time:  O(n)
+// Space: O(1)
+
 pub struct Solution {}
 impl Solution {
     pub fn single_number(nums: Vec<i32>) -> Vec<i32> {
-        nums
+        let x_xor_y: i32 = nums.iter().fold(0, |acc, &num| acc ^ num);
+        let bit: i32 = x_xor_y & -x_xor_y;
+        let mut result = vec![0; 2];
+        for i in nums {
+            result[((i & bit) != 0) as usize] ^= i
+        }
+        result
     }
 }
 
@@ -11,6 +20,6 @@ mod tests {
 
     #[test]
     fn test_single_number() {
-        assert_eq!(Solution::single_number(vec![1,2,1,3,2,5]), vec![3,5]);
+        assert_eq!(Solution::single_number(vec![1, 2, 1, 3, 2, 5]), vec![5, 3]);
     }
 }

From ce474e282adf62f79d21ad79fd2ebdb4d905b79b Mon Sep 17 00:00:00 2001
From: HAOYUatHZ <haoyu@protonmail.com>
Date: Sat, 20 Jul 2019 15:46:34 +0800
Subject: [PATCH 05/25] foreach

---
 kamyu104/src/single_number_iii.rs | 5 ++---
 1 file changed, 2 insertions(+), 3 deletions(-)

diff --git a/kamyu104/src/single_number_iii.rs b/kamyu104/src/single_number_iii.rs
index d06896c..5ff36f0 100644
--- a/kamyu104/src/single_number_iii.rs
+++ b/kamyu104/src/single_number_iii.rs
@@ -7,9 +7,8 @@ impl Solution {
         let x_xor_y: i32 = nums.iter().fold(0, |acc, &num| acc ^ num);
         let bit: i32 = x_xor_y & -x_xor_y;
         let mut result = vec![0; 2];
-        for i in nums {
-            result[((i & bit) != 0) as usize] ^= i
-        }
+        nums.iter()
+            .for_each(|i| result[((i & bit) != 0) as usize] ^= i);
         result
     }
 }

From 38bfbb95185e42ca0079ef9c3bd1800b5dc94711 Mon Sep 17 00:00:00 2001
From: HAOYUatHZ <haoyu@protonmail.com>
Date: Sat, 20 Jul 2019 15:58:10 +0800
Subject: [PATCH 06/25] add more

---
 kamyu104/src/reverse_bits.rs | 36 +++++++++++++++++++++++++++++++-----
 1 file changed, 31 insertions(+), 5 deletions(-)

diff --git a/kamyu104/src/reverse_bits.rs b/kamyu104/src/reverse_bits.rs
index 69a6b3f..29c5b96 100644
--- a/kamyu104/src/reverse_bits.rs
+++ b/kamyu104/src/reverse_bits.rs
@@ -1,11 +1,24 @@
 // Time : O(logn) = O(32)
 // Space: O(1)
 
-pub struct Solution {}
-impl Solution {
+pub struct Solution1 {}
+impl Solution1 {
     pub fn reverse_bits(mut n: u32) -> u32 {
         let mut result: u32 = 0;
-        for _ in (0..32) {
+        (0..32).for_each(|_| {
+            result <<= 1;
+            result |= n & 1;
+            n >>= 1;
+        });
+        result
+    }
+}
+
+pub struct Solution2 {}
+impl Solution2 {
+    pub fn reverse_bits(mut n: u32) -> u32 {
+        let mut result: u32 = 0;
+        for _ in 0..32 {
             result <<= 1;
             result |= n & 1;
             n >>= 1;
@@ -21,13 +34,26 @@ mod tests {
     #[test]
     fn test_reverse_bits() {
         assert_eq!(
-            Solution::reverse_bits(
+            Solution1::reverse_bits(
+                u32::from_str_radix("00000010100101000001111010011100", 2).unwrap()
+            ),
+            u32::from_str_radix("00111001011110000010100101000000", 2).unwrap()
+        );
+        assert_eq!(
+            Solution1::reverse_bits(
+                u32::from_str_radix("11111111111111111111111111111101", 2).unwrap()
+            ),
+            u32::from_str_radix("10111111111111111111111111111111", 2).unwrap()
+        );
+
+        assert_eq!(
+            Solution2::reverse_bits(
                 u32::from_str_radix("00000010100101000001111010011100", 2).unwrap()
             ),
             u32::from_str_radix("00111001011110000010100101000000", 2).unwrap()
         );
         assert_eq!(
-            Solution::reverse_bits(
+            Solution2::reverse_bits(
                 u32::from_str_radix("11111111111111111111111111111101", 2).unwrap()
             ),
             u32::from_str_radix("10111111111111111111111111111111", 2).unwrap()

From 28ca1b78db84e7b6c2fdd997cf10b851178bd302 Mon Sep 17 00:00:00 2001
From: HAOYUatHZ <haoyu@protonmail.com>
Date: Sat, 20 Jul 2019 16:08:38 +0800
Subject: [PATCH 07/25] init sol2

---
 kamyu104/src/single_number_iii.rs | 19 ++++++++++++++++---
 1 file changed, 16 insertions(+), 3 deletions(-)

diff --git a/kamyu104/src/single_number_iii.rs b/kamyu104/src/single_number_iii.rs
index 5ff36f0..690e182 100644
--- a/kamyu104/src/single_number_iii.rs
+++ b/kamyu104/src/single_number_iii.rs
@@ -1,8 +1,20 @@
 // Time:  O(n)
 // Space: O(1)
 
-pub struct Solution {}
-impl Solution {
+pub struct Solution1 {}
+impl Solution1 {
+    pub fn single_number(nums: Vec<i32>) -> Vec<i32> {
+        let x_xor_y: i32 = nums.iter().fold(0, |acc, &num| acc ^ num);
+        let bit: i32 = x_xor_y & -x_xor_y;
+        let mut result = vec![0; 2];
+        nums.iter()
+            .for_each(|i| result[((i & bit) != 0) as usize] ^= i);
+        result
+    }
+}
+
+pub struct Solution2 {}
+impl Solution2 {
     pub fn single_number(nums: Vec<i32>) -> Vec<i32> {
         let x_xor_y: i32 = nums.iter().fold(0, |acc, &num| acc ^ num);
         let bit: i32 = x_xor_y & -x_xor_y;
@@ -19,6 +31,7 @@ mod tests {
 
     #[test]
     fn test_single_number() {
-        assert_eq!(Solution::single_number(vec![1, 2, 1, 3, 2, 5]), vec![5, 3]);
+        assert_eq!(Solution1::single_number(vec![1, 2, 1, 3, 2, 5]), vec![5, 3]);
+        assert_eq!(Solution2::single_number(vec![1, 2, 1, 3, 2, 5]), vec![5, 3]);
     }
 }

From cfc62422ef8307935921072afb6f24e666d0154c Mon Sep 17 00:00:00 2001
From: HAOYUatHZ <haoyu@protonmail.com>
Date: Sat, 20 Jul 2019 16:24:36 +0800
Subject: [PATCH 08/25] add

---
 kamyu104/src/single_number_iii.rs | 30 ++++++++++++++++++++++++------
 1 file changed, 24 insertions(+), 6 deletions(-)

diff --git a/kamyu104/src/single_number_iii.rs b/kamyu104/src/single_number_iii.rs
index 690e182..b00d373 100644
--- a/kamyu104/src/single_number_iii.rs
+++ b/kamyu104/src/single_number_iii.rs
@@ -4,7 +4,12 @@
 pub struct Solution1 {}
 impl Solution1 {
     pub fn single_number(nums: Vec<i32>) -> Vec<i32> {
+        // Xor all the elements to get x ^ y.
         let x_xor_y: i32 = nums.iter().fold(0, |acc, &num| acc ^ num);
+
+        // Get the last bit where 1 occurs by "x & ~(x - 1)"
+        // Because -(x - 1) = ~(x - 1) + 1 <=> -x = ~(x - 1)
+        // So we can also get the last bit where 1 occurs by "x & -x"
         let bit: i32 = x_xor_y & -x_xor_y;
         let mut result = vec![0; 2];
         nums.iter()
@@ -16,12 +21,25 @@ impl Solution1 {
 pub struct Solution2 {}
 impl Solution2 {
     pub fn single_number(nums: Vec<i32>) -> Vec<i32> {
-        let x_xor_y: i32 = nums.iter().fold(0, |acc, &num| acc ^ num);
+        // Xor all the elements to get x ^ y.
+        let mut x_xor_y: i32 = 0;
+        for i in nums.iter() {
+            x_xor_y ^= i;
+        }
+
+        // Get the last bit where 1 occurs.
         let bit: i32 = x_xor_y & -x_xor_y;
-        let mut result = vec![0; 2];
-        nums.iter()
-            .for_each(|i| result[((i & bit) != 0) as usize] ^= i);
-        result
+
+        // Get the subset of A where the number has the bit.
+        // The subset only contains one of the two integers, call it x.
+        // Xor all the elements in the subset to get x.
+        let mut x: i32 = 0;
+        nums.iter().for_each(|i| {
+            if i & bit != 0 {
+                x ^= i;
+            }
+        });
+        vec![x, x_xor_y ^ x]
     }
 }
 
@@ -32,6 +50,6 @@ mod tests {
     #[test]
     fn test_single_number() {
         assert_eq!(Solution1::single_number(vec![1, 2, 1, 3, 2, 5]), vec![5, 3]);
-        assert_eq!(Solution2::single_number(vec![1, 2, 1, 3, 2, 5]), vec![5, 3]);
+        assert_eq!(Solution2::single_number(vec![1, 2, 1, 3, 2, 5]), vec![3, 5]);
     }
 }

From 14fed544c3b04c0a1276d3d38fae8238cc0bacf1 Mon Sep 17 00:00:00 2001
From: HAOYUatHZ <haoyu@protonmail.com>
Date: Sat, 20 Jul 2019 16:26:19 +0800
Subject: [PATCH 09/25] clean

---
 kamyu104/src/power_of_two.rs      | 1 -
 kamyu104/src/single_number_iii.rs | 1 +
 2 files changed, 1 insertion(+), 1 deletion(-)

diff --git a/kamyu104/src/power_of_two.rs b/kamyu104/src/power_of_two.rs
index 96048a7..8cc3096 100644
--- a/kamyu104/src/power_of_two.rs
+++ b/kamyu104/src/power_of_two.rs
@@ -17,7 +17,6 @@ impl Solution2 {
 
 #[cfg(test)]
 mod tests {
-    // Note this useful idiom: importing names from outer (for mod tests) scope.
     use super::*;
 
     #[test]
diff --git a/kamyu104/src/single_number_iii.rs b/kamyu104/src/single_number_iii.rs
index b00d373..bf9e88f 100644
--- a/kamyu104/src/single_number_iii.rs
+++ b/kamyu104/src/single_number_iii.rs
@@ -50,6 +50,7 @@ mod tests {
     #[test]
     fn test_single_number() {
         assert_eq!(Solution1::single_number(vec![1, 2, 1, 3, 2, 5]), vec![5, 3]);
+        
         assert_eq!(Solution2::single_number(vec![1, 2, 1, 3, 2, 5]), vec![3, 5]);
     }
 }

From 7178f9d4ee229b2715624ce705325c7afbcb315d Mon Sep 17 00:00:00 2001
From: HAOYUatHZ <haoyu@protonmail.com>
Date: Sat, 20 Jul 2019 16:26:46 +0800
Subject: [PATCH 10/25] clean

---
 kamyu104/src/single_number_iii.rs | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/kamyu104/src/single_number_iii.rs b/kamyu104/src/single_number_iii.rs
index bf9e88f..38b19c9 100644
--- a/kamyu104/src/single_number_iii.rs
+++ b/kamyu104/src/single_number_iii.rs
@@ -50,7 +50,7 @@ mod tests {
     #[test]
     fn test_single_number() {
         assert_eq!(Solution1::single_number(vec![1, 2, 1, 3, 2, 5]), vec![5, 3]);
-        
+
         assert_eq!(Solution2::single_number(vec![1, 2, 1, 3, 2, 5]), vec![3, 5]);
     }
 }

From 7389e3464e7fd4c6a2d63a603103b6f2c4b234af Mon Sep 17 00:00:00 2001
From: HAOYUatHZ <haoyu@protonmail.com>
Date: Sat, 20 Jul 2019 16:30:25 +0800
Subject: [PATCH 11/25] init missing_number

---
 kamyu104/src/main.rs           | 1 +
 kamyu104/src/missing_number.rs | 1 +
 2 files changed, 2 insertions(+)
 create mode 100644 kamyu104/src/missing_number.rs

diff --git a/kamyu104/src/main.rs b/kamyu104/src/main.rs
index f6ffca0..855a106 100644
--- a/kamyu104/src/main.rs
+++ b/kamyu104/src/main.rs
@@ -1,4 +1,5 @@
 mod bitwise_and_of_numbers_range;
+mod missing_number;
 mod number_of_1_bits;
 mod power_of_two;
 mod reverse_bits;
diff --git a/kamyu104/src/missing_number.rs b/kamyu104/src/missing_number.rs
new file mode 100644
index 0000000..8b13789
--- /dev/null
+++ b/kamyu104/src/missing_number.rs
@@ -0,0 +1 @@
+

From 810d3bdc13536bb9c2749daddc888211bcdc5458 Mon Sep 17 00:00:00 2001
From: HAOYUatHZ <haoyu@protonmail.com>
Date: Sat, 20 Jul 2019 16:34:38 +0800
Subject: [PATCH 12/25] add

---
 kamyu104/src/missing_number.rs | 16 ++++++++++++++++
 1 file changed, 16 insertions(+)

diff --git a/kamyu104/src/missing_number.rs b/kamyu104/src/missing_number.rs
index 8b13789..4b698a5 100644
--- a/kamyu104/src/missing_number.rs
+++ b/kamyu104/src/missing_number.rs
@@ -1 +1,17 @@
+pub struct Solution {}
+impl Solution {
+    pub fn missing_number(nums: Vec<i32>) -> i32 {
+        0
+    }
+}
 
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    fn test_missing_number() {
+        assert_eq!(Solution::missing_number(vec![3, 0, 1]), 2);
+        assert_eq!(Solution::missing_number(vec![9, 6, 4, 2, 3, 5, 7, 0, 1]), 8);
+    }
+}

From 076b0cc998ccd751ea010856221651ca75aa114d Mon Sep 17 00:00:00 2001
From: HAOYUatHZ <haoyu@protonmail.com>
Date: Sat, 20 Jul 2019 16:37:26 +0800
Subject: [PATCH 13/25] add more

---
 kamyu104/src/missing_number.rs | 28 ++++++++++++++++++++++++----
 1 file changed, 24 insertions(+), 4 deletions(-)

diff --git a/kamyu104/src/missing_number.rs b/kamyu104/src/missing_number.rs
index 4b698a5..e8623ec 100644
--- a/kamyu104/src/missing_number.rs
+++ b/kamyu104/src/missing_number.rs
@@ -1,5 +1,16 @@
-pub struct Solution {}
-impl Solution {
+// Time:  O(n)
+// Space: O(1)
+pub struct Solution1 {}
+impl Solution1 {
+    pub fn missing_number(nums: Vec<i32>) -> i32 {
+        0
+    }
+}
+
+// Time:  O(n)
+// Space: O(n)
+pub struct Solution2 {}
+impl Solution2 {
     pub fn missing_number(nums: Vec<i32>) -> i32 {
         0
     }
@@ -11,7 +22,16 @@ mod tests {
 
     #[test]
     fn test_missing_number() {
-        assert_eq!(Solution::missing_number(vec![3, 0, 1]), 2);
-        assert_eq!(Solution::missing_number(vec![9, 6, 4, 2, 3, 5, 7, 0, 1]), 8);
+        assert_eq!(Solution1::missing_number(vec![3, 0, 1]), 2);
+        assert_eq!(
+            Solution1::missing_number(vec![9, 6, 4, 2, 3, 5, 7, 0, 1]),
+            8
+        );
+
+        assert_eq!(Solution2::missing_number(vec![3, 0, 1]), 2);
+        assert_eq!(
+            Solution2::missing_number(vec![9, 6, 4, 2, 3, 5, 7, 0, 1]),
+            8
+        );
     }
 }

From e289b51126848987f46d69aeb4f36887ba796c80 Mon Sep 17 00:00:00 2001
From: HAOYUatHZ <haoyu@protonmail.com>
Date: Sat, 20 Jul 2019 16:54:36 +0800
Subject: [PATCH 14/25] add missing_number

---
 kamyu104/src/missing_number.rs | 28 ++++++++++++++++------------
 1 file changed, 16 insertions(+), 12 deletions(-)

diff --git a/kamyu104/src/missing_number.rs b/kamyu104/src/missing_number.rs
index e8623ec..dadbedd 100644
--- a/kamyu104/src/missing_number.rs
+++ b/kamyu104/src/missing_number.rs
@@ -3,18 +3,22 @@
 pub struct Solution1 {}
 impl Solution1 {
     pub fn missing_number(nums: Vec<i32>) -> i32 {
-        0
+        let mut num: i32 = 0;
+        for i in 0..nums.len() {
+            num ^= nums[i] ^ (i + 1) as i32;
+        }
+        num
     }
 }
 
 // Time:  O(n)
 // Space: O(n)
-pub struct Solution2 {}
-impl Solution2 {
-    pub fn missing_number(nums: Vec<i32>) -> i32 {
-        0
-    }
-}
+// pub struct Solution2 {}
+// impl Solution2 {
+//     pub fn missing_number(nums: Vec<i32>) -> i32 {
+//         0
+//     }
+// }
 
 #[cfg(test)]
 mod tests {
@@ -28,10 +32,10 @@ mod tests {
             8
         );
 
-        assert_eq!(Solution2::missing_number(vec![3, 0, 1]), 2);
-        assert_eq!(
-            Solution2::missing_number(vec![9, 6, 4, 2, 3, 5, 7, 0, 1]),
-            8
-        );
+        // assert_eq!(Solution2::missing_number(vec![3, 0, 1]), 2);
+        // assert_eq!(
+        //     Solution2::missing_number(vec![9, 6, 4, 2, 3, 5, 7, 0, 1]),
+        //     8
+        // );
     }
 }

From a60b3905c039897305dee3ea417ae8f2060255ab Mon Sep 17 00:00:00 2001
From: HAOYUatHZ <haoyu@protonmail.com>
Date: Sat, 20 Jul 2019 16:57:36 +0800
Subject: [PATCH 15/25] add mroe

---
 kamyu104/src/missing_number.rs | 30 ++++++++++++++++++++++++++++++
 1 file changed, 30 insertions(+)

diff --git a/kamyu104/src/missing_number.rs b/kamyu104/src/missing_number.rs
index dadbedd..cb9e37e 100644
--- a/kamyu104/src/missing_number.rs
+++ b/kamyu104/src/missing_number.rs
@@ -20,6 +20,24 @@ impl Solution1 {
 //     }
 // }
 
+// Time:  O(n)
+// Space: O(1)
+// pub struct Solution3 {}
+// impl Solution3 {
+//     pub fn missing_number(nums: Vec<i32>) -> i32 {
+//         0
+//     }
+// }
+
+// Time:  O(n)
+// Space: O(1)
+// pub struct Solution4 {}
+// impl Solution4 {
+//     pub fn missing_number(nums: Vec<i32>) -> i32 {
+//         0
+//     }
+// }
+
 #[cfg(test)]
 mod tests {
     use super::*;
@@ -37,5 +55,17 @@ mod tests {
         //     Solution2::missing_number(vec![9, 6, 4, 2, 3, 5, 7, 0, 1]),
         //     8
         // );
+
+        // assert_eq!(Solution3::missing_number(vec![3, 0, 1]), 2);
+        // assert_eq!(
+        //     Solution2::missing_number(vec![9, 6, 4, 2, 3, 5, 7, 0, 1]),
+        //     8
+        // );
+
+        // assert_eq!(Solution4::missing_number(vec![3, 0, 1]), 2);
+        // assert_eq!(
+        //     Solution2::missing_number(vec![9, 6, 4, 2, 3, 5, 7, 0, 1]),
+        //     8
+        // );
     }
 }

From 972cd52831025bc531bb600c38e31eb61dd5bbc8 Mon Sep 17 00:00:00 2001
From: HAOYUatHZ <haoyu@protonmail.com>
Date: Sat, 20 Jul 2019 17:24:18 +0800
Subject: [PATCH 16/25] add sol4

---
 kamyu104/src/missing_number.rs | 22 +++++++++++-----------
 1 file changed, 11 insertions(+), 11 deletions(-)

diff --git a/kamyu104/src/missing_number.rs b/kamyu104/src/missing_number.rs
index cb9e37e..efac805 100644
--- a/kamyu104/src/missing_number.rs
+++ b/kamyu104/src/missing_number.rs
@@ -31,12 +31,12 @@ impl Solution1 {
 
 // Time:  O(n)
 // Space: O(1)
-// pub struct Solution4 {}
-// impl Solution4 {
-//     pub fn missing_number(nums: Vec<i32>) -> i32 {
-//         0
-//     }
-// }
+pub struct Solution4 {}
+impl Solution4 {
+    pub fn missing_number(nums: Vec<i32>) -> i32 {
+        ((0..nums.len() + 1).fold(0, |acc, i| acc + (i as i32))) - nums.iter().sum::<i32>()
+    }
+}
 
 #[cfg(test)]
 mod tests {
@@ -62,10 +62,10 @@ mod tests {
         //     8
         // );
 
-        // assert_eq!(Solution4::missing_number(vec![3, 0, 1]), 2);
-        // assert_eq!(
-        //     Solution2::missing_number(vec![9, 6, 4, 2, 3, 5, 7, 0, 1]),
-        //     8
-        // );
+        assert_eq!(Solution4::missing_number(vec![3, 0, 1]), 2);
+        assert_eq!(
+            Solution4::missing_number(vec![9, 6, 4, 2, 3, 5, 7, 0, 1]),
+            8
+        );
     }
 }

From 1baf60f84a799b64190164dab2e8013ac3e34b53 Mon Sep 17 00:00:00 2001
From: HAOYUatHZ <haoyu@protonmail.com>
Date: Sat, 20 Jul 2019 17:37:16 +0800
Subject: [PATCH 17/25] add sol3

---
 kamyu104/src/missing_number.rs | 23 ++++++++++++-----------
 1 file changed, 12 insertions(+), 11 deletions(-)

diff --git a/kamyu104/src/missing_number.rs b/kamyu104/src/missing_number.rs
index efac805..e12b6a5 100644
--- a/kamyu104/src/missing_number.rs
+++ b/kamyu104/src/missing_number.rs
@@ -22,12 +22,13 @@ impl Solution1 {
 
 // Time:  O(n)
 // Space: O(1)
-// pub struct Solution3 {}
-// impl Solution3 {
-//     pub fn missing_number(nums: Vec<i32>) -> i32 {
-//         0
-//     }
-// }
+pub struct Solution3 {}
+impl Solution3 {
+    pub fn missing_number(nums: Vec<i32>) -> i32 {
+        let len_xor = (0..nums.len() + 1).fold(0, |acc, i| acc ^ i as i32);
+        nums.iter().fold(len_xor, |acc, &i| acc ^ i)
+    }
+}
 
 // Time:  O(n)
 // Space: O(1)
@@ -56,11 +57,11 @@ mod tests {
         //     8
         // );
 
-        // assert_eq!(Solution3::missing_number(vec![3, 0, 1]), 2);
-        // assert_eq!(
-        //     Solution2::missing_number(vec![9, 6, 4, 2, 3, 5, 7, 0, 1]),
-        //     8
-        // );
+        assert_eq!(Solution3::missing_number(vec![3, 0, 1]), 2);
+        assert_eq!(
+            Solution3::missing_number(vec![9, 6, 4, 2, 3, 5, 7, 0, 1]),
+            8
+        );
 
         assert_eq!(Solution4::missing_number(vec![3, 0, 1]), 2);
         assert_eq!(

From db427603a84b1a8bfd4315d97e5ec4a93f20475b Mon Sep 17 00:00:00 2001
From: HAOYUatHZ <haoyu@protonmail.com>
Date: Sat, 20 Jul 2019 17:39:56 +0800
Subject: [PATCH 18/25] udpate readme

---
 README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/README.md b/README.md
index 9a39431..1d738ce 100644
--- a/README.md
+++ b/README.md
@@ -55,10 +55,10 @@ cargo test
 0201 | [Bitwise AND of Numbers Range](https://leetcode.com/problems/bitwise-and-of-numbers-range/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/bitwise-and-of-numbers-range.cpp), [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/bitwise-and-of-numbers-range.py) <br> [Rust](./kamyu104/src/bitwise_and_of_numbers_range.rs) | _O(1)_ | _O(1)_ | Medium ||
 0231 | [Power of Two](https://leetcode.com/problems/power-of-two/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/power-of-two.cpp), [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/power-of-two.py) <br> [Rust](./kamyu104/src/power_of_two.rs) | _O(1)_ | _O(1)_ | Easy | LintCode |
 0260 | [Single Number III](https://leetcode.com/problems/single-number-iii/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/single-number-iii.cpp), [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/single-number-iii.py) <br> [Rust](./kamyu104/src/single_number_iii.rs) | _O(n)_ | _O(1)_          | Medium         ||
+0268| [Missing Number](https://leetcode.com/problems/missing-number/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/missing-number.cpp), [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/missing-number.py) <br> [Rust](./kamyu104/src/missing_number.rs) | _O(n)_ |  _O(1)_ | Medium         | LintCode ||
 
 <!-- 
 
-0268| [Missing Number](https://leetcode.com/problems/missing-number/) | [C++](./C++/missing-number.cpp) [Python](./Python/missing-number.py)  | _O(n)_ |  _O(1)_ | Medium         | LintCode ||
 0318| [Maximum Product of Word Lengths](https://leetcode.com/problems/maximum-product-of-word-lengths/) | [C++](./C++/maximum-product-of-word-lengths.cpp) [Python](./Python/maximum-product-of-word-lengths.py)  | _O(n)_ ~ _O(n^2)_ |  _O(n)_ | Medium         || Bit Manipulation, Counting Sort, Pruning|
 0342 | [Power of Four](https://leetcode.com/problems/power-of-four/) | [C++](./C++/power-of-four.cpp) [Python](./Python/power-of-four.py) | _O(1)_ | _O(1)_ | Easy | |
 0371 | [Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers/) | [C++](./C++/sum-of-two-integers.cpp) [Python](./Python/sum-of-two-integers.py) | _O(1)_ | _O(1)_ | Easy | LintCode |

From e7ea8027409df2ef6054a5aa28c6c90f90079951 Mon Sep 17 00:00:00 2001
From: HAOYUatHZ <haoyu@protonmail.com>
Date: Sat, 20 Jul 2019 17:59:19 +0800
Subject: [PATCH 19/25] init maximum_product_of_word_lengths

---
 kamyu104/src/main.rs                            | 1 +
 kamyu104/src/maximum_product_of_word_lengths.rs | 0
 2 files changed, 1 insertion(+)
 create mode 100644 kamyu104/src/maximum_product_of_word_lengths.rs

diff --git a/kamyu104/src/main.rs b/kamyu104/src/main.rs
index 855a106..e821b08 100644
--- a/kamyu104/src/main.rs
+++ b/kamyu104/src/main.rs
@@ -6,4 +6,5 @@ mod reverse_bits;
 mod single_number;
 mod single_number_ii;
 mod single_number_iii;
+mod maximum_product_of_word_lengths;
 mod template;
diff --git a/kamyu104/src/maximum_product_of_word_lengths.rs b/kamyu104/src/maximum_product_of_word_lengths.rs
new file mode 100644
index 0000000..e69de29

From 6c30f646736d8ff6fbf305dfce5505469e07a586 Mon Sep 17 00:00:00 2001
From: HAOYUatHZ <haoyu@protonmail.com>
Date: Sat, 20 Jul 2019 18:01:46 +0800
Subject: [PATCH 20/25] update readme

---
 README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/README.md b/README.md
index 1d738ce..638d60c 100644
--- a/README.md
+++ b/README.md
@@ -56,10 +56,10 @@ cargo test
 0231 | [Power of Two](https://leetcode.com/problems/power-of-two/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/power-of-two.cpp), [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/power-of-two.py) <br> [Rust](./kamyu104/src/power_of_two.rs) | _O(1)_ | _O(1)_ | Easy | LintCode |
 0260 | [Single Number III](https://leetcode.com/problems/single-number-iii/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/single-number-iii.cpp), [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/single-number-iii.py) <br> [Rust](./kamyu104/src/single_number_iii.rs) | _O(n)_ | _O(1)_          | Medium         ||
 0268| [Missing Number](https://leetcode.com/problems/missing-number/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/missing-number.cpp), [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/missing-number.py) <br> [Rust](./kamyu104/src/missing_number.rs) | _O(n)_ |  _O(1)_ | Medium         | LintCode ||
+0318| [Maximum Product of Word Lengths](https://leetcode.com/problems/maximum-product-of-word-lengths/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/maximum-product-of-word-lengths.cpp) [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/maximum-product-of-word-lengths.py) <br> [Rust](./kamyu104/src/maximum_product_of_word_lengths.rs) | _O(n)_ ~ _O(n^2)_ |  _O(n)_ | Medium         || Bit Manipulation, Counting Sort, Pruning|
 
 <!-- 
 
-0318| [Maximum Product of Word Lengths](https://leetcode.com/problems/maximum-product-of-word-lengths/) | [C++](./C++/maximum-product-of-word-lengths.cpp) [Python](./Python/maximum-product-of-word-lengths.py)  | _O(n)_ ~ _O(n^2)_ |  _O(n)_ | Medium         || Bit Manipulation, Counting Sort, Pruning|
 0342 | [Power of Four](https://leetcode.com/problems/power-of-four/) | [C++](./C++/power-of-four.cpp) [Python](./Python/power-of-four.py) | _O(1)_ | _O(1)_ | Easy | |
 0371 | [Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers/) | [C++](./C++/sum-of-two-integers.cpp) [Python](./Python/sum-of-two-integers.py) | _O(1)_ | _O(1)_ | Easy | LintCode |
 0389 | [Find the Difference](https://leetcode.com/problems/find-the-difference/) | [C++](./C++/find-the-difference.cpp) [Python](./Python/find-the-difference.py) | _O(n)_ | _O(1)_ | Easy | |

From 987dcda1ed5e3c9ea158e981406ed7ce2c4e8cd8 Mon Sep 17 00:00:00 2001
From: HAOYUatHZ <haoyu@protonmail.com>
Date: Sat, 20 Jul 2019 18:05:04 +0800
Subject: [PATCH 21/25] minor

---
 README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/README.md b/README.md
index 638d60c..3ae0bc5 100644
--- a/README.md
+++ b/README.md
@@ -56,7 +56,7 @@ cargo test
 0231 | [Power of Two](https://leetcode.com/problems/power-of-two/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/power-of-two.cpp), [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/power-of-two.py) <br> [Rust](./kamyu104/src/power_of_two.rs) | _O(1)_ | _O(1)_ | Easy | LintCode |
 0260 | [Single Number III](https://leetcode.com/problems/single-number-iii/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/single-number-iii.cpp), [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/single-number-iii.py) <br> [Rust](./kamyu104/src/single_number_iii.rs) | _O(n)_ | _O(1)_          | Medium         ||
 0268| [Missing Number](https://leetcode.com/problems/missing-number/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/missing-number.cpp), [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/missing-number.py) <br> [Rust](./kamyu104/src/missing_number.rs) | _O(n)_ |  _O(1)_ | Medium         | LintCode ||
-0318| [Maximum Product of Word Lengths](https://leetcode.com/problems/maximum-product-of-word-lengths/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/maximum-product-of-word-lengths.cpp) [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/maximum-product-of-word-lengths.py) <br> [Rust](./kamyu104/src/maximum_product_of_word_lengths.rs) | _O(n)_ ~ _O(n^2)_ |  _O(n)_ | Medium         || Bit Manipulation, Counting Sort, Pruning|
+0318| [Maximum Product of Word Lengths](https://leetcode.com/problems/maximum-product-of-word-lengths/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/maximum-product-of-word-lengths.cpp), [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/maximum-product-of-word-lengths.py) <br> [Rust](./kamyu104/src/maximum_product_of_word_lengths.rs) | _O(n)_ ~ _O(n^2)_ |  _O(n)_ | Medium         || Bit Manipulation, Counting Sort, Pruning|
 
 <!-- 
 

From b1a1712b755c5a89ea424be2d922a35938210360 Mon Sep 17 00:00:00 2001
From: HAOYUatHZ <haoyu@protonmail.com>
Date: Sat, 20 Jul 2019 18:07:32 +0800
Subject: [PATCH 22/25] update

---
 README.md                                      | 18 +++++++++---------
 .../src/maximum_product_of_word_lengths.rs     | 16 ++++++++++++++++
 2 files changed, 25 insertions(+), 9 deletions(-)

diff --git a/README.md b/README.md
index 3ae0bc5..255b2d2 100644
--- a/README.md
+++ b/README.md
@@ -48,15 +48,15 @@ cargo test
 #### Bit Manipulation
 |  #  | Title           |  Solution       |  Time           | Space           | Difficulty    | Tag          | Note| 
 |-----|---------------- | --------------- | --------------- | --------------- | ------------- |--------------|-----|
-0136 | [Single Number](https://leetcode.com/problems/single-number/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/single-number.cpp), [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/single-number.py) <br> [Rust](./kamyu104/src/single_number.rs) | _O(n)_       | _O(1)_          | Easy         |||
-0137 | [Single Number II](https://leetcode.com/problems/single-number-ii/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/single-number-ii.cpp), [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/single-number-ii.py) <br> [Rust](./kamyu104/src/single_number_ii.rs) | _O(n)_ | _O(1)_          | Medium         |||
-0190 | [Reverse Bits](https://leetcode.com/problems/reverse-bits/)  | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/reverse-bits.cpp), [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/reverse-bits.py) <br> [Rust](./kamyu104/src/reverse_bits.rs) | _O(1)_        | _O(1)_          | Easy           |||
-0191  |[Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/number-of-1-bits.cpp), [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/number-of-1-bits.py) <br> [Rust](./kamyu104/src/number_of_1_bits.rs) | _O(1)_ | _O(1)_          | Easy           |||
-0201 | [Bitwise AND of Numbers Range](https://leetcode.com/problems/bitwise-and-of-numbers-range/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/bitwise-and-of-numbers-range.cpp), [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/bitwise-and-of-numbers-range.py) <br> [Rust](./kamyu104/src/bitwise_and_of_numbers_range.rs) | _O(1)_ | _O(1)_ | Medium ||
-0231 | [Power of Two](https://leetcode.com/problems/power-of-two/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/power-of-two.cpp), [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/power-of-two.py) <br> [Rust](./kamyu104/src/power_of_two.rs) | _O(1)_ | _O(1)_ | Easy | LintCode |
-0260 | [Single Number III](https://leetcode.com/problems/single-number-iii/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/single-number-iii.cpp), [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/single-number-iii.py) <br> [Rust](./kamyu104/src/single_number_iii.rs) | _O(n)_ | _O(1)_          | Medium         ||
-0268| [Missing Number](https://leetcode.com/problems/missing-number/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/missing-number.cpp), [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/missing-number.py) <br> [Rust](./kamyu104/src/missing_number.rs) | _O(n)_ |  _O(1)_ | Medium         | LintCode ||
-0318| [Maximum Product of Word Lengths](https://leetcode.com/problems/maximum-product-of-word-lengths/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/maximum-product-of-word-lengths.cpp), [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/maximum-product-of-word-lengths.py) <br> [Rust](./kamyu104/src/maximum_product_of_word_lengths.rs) | _O(n)_ ~ _O(n^2)_ |  _O(n)_ | Medium         || Bit Manipulation, Counting Sort, Pruning|
+0136 | [Single Number](https://leetcode.com/problems/single-number/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/single-number.cpp) [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/single-number.py) <br> [Rust](./kamyu104/src/single_number.rs) | _O(n)_       | _O(1)_          | Easy         |||
+0137 | [Single Number II](https://leetcode.com/problems/single-number-ii/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/single-number-ii.cpp) [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/single-number-ii.py) <br> [Rust](./kamyu104/src/single_number_ii.rs) | _O(n)_ | _O(1)_          | Medium         |||
+0190 | [Reverse Bits](https://leetcode.com/problems/reverse-bits/)  | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/reverse-bits.cpp) [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/reverse-bits.py) <br> [Rust](./kamyu104/src/reverse_bits.rs) | _O(1)_        | _O(1)_          | Easy           |||
+0191  |[Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/number-of-1-bits.cpp) [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/number-of-1-bits.py) <br> [Rust](./kamyu104/src/number_of_1_bits.rs) | _O(1)_ | _O(1)_          | Easy           |||
+0201 | [Bitwise AND of Numbers Range](https://leetcode.com/problems/bitwise-and-of-numbers-range/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/bitwise-and-of-numbers-range.cpp) [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/bitwise-and-of-numbers-range.py) <br> [Rust](./kamyu104/src/bitwise_and_of_numbers_range.rs) | _O(1)_ | _O(1)_ | Medium ||
+0231 | [Power of Two](https://leetcode.com/problems/power-of-two/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/power-of-two.cpp) [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/power-of-two.py) <br> [Rust](./kamyu104/src/power_of_two.rs) | _O(1)_ | _O(1)_ | Easy | LintCode |
+0260 | [Single Number III](https://leetcode.com/problems/single-number-iii/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/single-number-iii.cpp) [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/single-number-iii.py) <br> [Rust](./kamyu104/src/single_number_iii.rs) | _O(n)_ | _O(1)_          | Medium         ||
+0268| [Missing Number](https://leetcode.com/problems/missing-number/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/missing-number.cpp) [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/missing-number.py) <br> [Rust](./kamyu104/src/missing_number.rs) | _O(n)_ |  _O(1)_ | Medium         | LintCode ||
+0318| [Maximum Product of Word Lengths](https://leetcode.com/problems/maximum-product-of-word-lengths/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/maximum-product-of-word-lengths.cpp) [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/maximum-product-of-word-lengths.py) <br> [Rust](./kamyu104/src/maximum_product_of_word_lengths.rs) | _O(n)_ ~ _O(n^2)_ |  _O(n)_ | Medium         || Bit Manipulation, Counting Sort, Pruning|
 
 <!-- 
 
diff --git a/kamyu104/src/maximum_product_of_word_lengths.rs b/kamyu104/src/maximum_product_of_word_lengths.rs
index e69de29..3d67639 100644
--- a/kamyu104/src/maximum_product_of_word_lengths.rs
+++ b/kamyu104/src/maximum_product_of_word_lengths.rs
@@ -0,0 +1,16 @@
+pub struct Solution {}
+impl Solution {
+    pub fn max_product(words: Vec<String>) -> i32 {
+        0
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    // Note this useful idiom: importing names from outer (for mod tests) scope.
+    use super::*;
+
+    #[test]
+    fn test_max_product() {
+    }
+}

From be4bafb68e931b2dd967f3267fe58d0dc4d10847 Mon Sep 17 00:00:00 2001
From: HAOYUatHZ <haoyu@protonmail.com>
Date: Sat, 20 Jul 2019 18:09:49 +0800
Subject: [PATCH 23/25] fix readme

---
 README.md | 18 +++++++++---------
 1 file changed, 9 insertions(+), 9 deletions(-)

diff --git a/README.md b/README.md
index 255b2d2..ee4678e 100644
--- a/README.md
+++ b/README.md
@@ -48,15 +48,15 @@ cargo test
 #### Bit Manipulation
 |  #  | Title           |  Solution       |  Time           | Space           | Difficulty    | Tag          | Note| 
 |-----|---------------- | --------------- | --------------- | --------------- | ------------- |--------------|-----|
-0136 | [Single Number](https://leetcode.com/problems/single-number/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/single-number.cpp) [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/single-number.py) <br> [Rust](./kamyu104/src/single_number.rs) | _O(n)_       | _O(1)_          | Easy         |||
-0137 | [Single Number II](https://leetcode.com/problems/single-number-ii/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/single-number-ii.cpp) [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/single-number-ii.py) <br> [Rust](./kamyu104/src/single_number_ii.rs) | _O(n)_ | _O(1)_          | Medium         |||
-0190 | [Reverse Bits](https://leetcode.com/problems/reverse-bits/)  | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/reverse-bits.cpp) [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/reverse-bits.py) <br> [Rust](./kamyu104/src/reverse_bits.rs) | _O(1)_        | _O(1)_          | Easy           |||
-0191  |[Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/number-of-1-bits.cpp) [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/number-of-1-bits.py) <br> [Rust](./kamyu104/src/number_of_1_bits.rs) | _O(1)_ | _O(1)_          | Easy           |||
-0201 | [Bitwise AND of Numbers Range](https://leetcode.com/problems/bitwise-and-of-numbers-range/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/bitwise-and-of-numbers-range.cpp) [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/bitwise-and-of-numbers-range.py) <br> [Rust](./kamyu104/src/bitwise_and_of_numbers_range.rs) | _O(1)_ | _O(1)_ | Medium ||
-0231 | [Power of Two](https://leetcode.com/problems/power-of-two/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/power-of-two.cpp) [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/power-of-two.py) <br> [Rust](./kamyu104/src/power_of_two.rs) | _O(1)_ | _O(1)_ | Easy | LintCode |
-0260 | [Single Number III](https://leetcode.com/problems/single-number-iii/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/single-number-iii.cpp) [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/single-number-iii.py) <br> [Rust](./kamyu104/src/single_number_iii.rs) | _O(n)_ | _O(1)_          | Medium         ||
-0268| [Missing Number](https://leetcode.com/problems/missing-number/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/missing-number.cpp) [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/missing-number.py) <br> [Rust](./kamyu104/src/missing_number.rs) | _O(n)_ |  _O(1)_ | Medium         | LintCode ||
-0318| [Maximum Product of Word Lengths](https://leetcode.com/problems/maximum-product-of-word-lengths/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/maximum-product-of-word-lengths.cpp) [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/maximum-product-of-word-lengths.py) <br> [Rust](./kamyu104/src/maximum_product_of_word_lengths.rs) | _O(n)_ ~ _O(n^2)_ |  _O(n)_ | Medium         || Bit Manipulation, Counting Sort, Pruning|
+0136 | [Single Number](https://leetcode.com/problems/single-number/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/single-number.cpp) [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/single-number.py) <br>------</br> [Rust](./kamyu104/src/single_number.rs) | _O(n)_       | _O(1)_          | Easy         |||
+0137 | [Single Number II](https://leetcode.com/problems/single-number-ii/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/single-number-ii.cpp) [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/single-number-ii.py) <br>------</br> [Rust](./kamyu104/src/single_number_ii.rs) | _O(n)_ | _O(1)_          | Medium         |||
+0190 | [Reverse Bits](https://leetcode.com/problems/reverse-bits/)  | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/reverse-bits.cpp) [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/reverse-bits.py) <br>------</br> [Rust](./kamyu104/src/reverse_bits.rs) | _O(1)_        | _O(1)_          | Easy           |||
+0191  |[Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/number-of-1-bits.cpp) [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/number-of-1-bits.py) <br>------</br> [Rust](./kamyu104/src/number_of_1_bits.rs) | _O(1)_ | _O(1)_          | Easy           |||
+0201 | [Bitwise AND of Numbers Range](https://leetcode.com/problems/bitwise-and-of-numbers-range/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/bitwise-and-of-numbers-range.cpp) [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/bitwise-and-of-numbers-range.py) <br>------</br> [Rust](./kamyu104/src/bitwise_and_of_numbers_range.rs) | _O(1)_ | _O(1)_ | Medium ||
+0231 | [Power of Two](https://leetcode.com/problems/power-of-two/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/power-of-two.cpp) [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/power-of-two.py) <br>------</br> [Rust](./kamyu104/src/power_of_two.rs) | _O(1)_ | _O(1)_ | Easy | LintCode |
+0260 | [Single Number III](https://leetcode.com/problems/single-number-iii/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/single-number-iii.cpp) [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/single-number-iii.py) <br>------</br> [Rust](./kamyu104/src/single_number_iii.rs) | _O(n)_ | _O(1)_          | Medium         ||
+0268| [Missing Number](https://leetcode.com/problems/missing-number/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/missing-number.cpp) [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/missing-number.py) <br>------</br> [Rust](./kamyu104/src/missing_number.rs) | _O(n)_ |  _O(1)_ | Medium         | LintCode ||
+0318| [Maximum Product of Word Lengths](https://leetcode.com/problems/maximum-product-of-word-lengths/) | [C++](https://github.com/kamyu104/LeetCode-Solutions/blob/master/C++/maximum-product-of-word-lengths.cpp) [Python](https://github.com/kamyu104/LeetCode-Solutions/blob/master/Python/maximum-product-of-word-lengths.py) <br>------</br> [Rust](./kamyu104/src/maximum_product_of_word_lengths.rs) | _O(n)_ ~ _O(n^2)_ |  _O(n)_ | Medium         || Bit Manipulation, Counting Sort, Pruning|
 
 <!-- 
 

From eb63411ddb479032fb7dd944220f52db5ba441f7 Mon Sep 17 00:00:00 2001
From: HAOYUatHZ <haoyu@protonmail.com>
Date: Sat, 20 Jul 2019 18:14:38 +0800
Subject: [PATCH 24/25] init max_product

---
 kamyu104/src/maximum_product_of_word_lengths.rs | 4 +++-
 1 file changed, 3 insertions(+), 1 deletion(-)

diff --git a/kamyu104/src/maximum_product_of_word_lengths.rs b/kamyu104/src/maximum_product_of_word_lengths.rs
index 3d67639..9d86c2a 100644
--- a/kamyu104/src/maximum_product_of_word_lengths.rs
+++ b/kamyu104/src/maximum_product_of_word_lengths.rs
@@ -7,10 +7,12 @@ impl Solution {
 
 #[cfg(test)]
 mod tests {
-    // Note this useful idiom: importing names from outer (for mod tests) scope.
     use super::*;
 
     #[test]
     fn test_max_product() {
+        assert_max_product!(Solution::max_product(vec!["abcw","baz","foo","bar","xtfn","abcdef"]), 16);
+        assert_max_product!(Solution::max_product(vec!["a","ab","abc","d","cd","bcd","abcd"]), 4);
+        assert_max_product!(Solution::max_product(vec!["a","aa","aaa","aaaa"]), 0);
     }
 }

From 21fd9ba0130a35a2242619d321dfaef33bb5ac00 Mon Sep 17 00:00:00 2001
From: HAOYUatHZ <haoyu@protonmail.com>
Date: Sat, 20 Jul 2019 18:19:57 +0800
Subject: [PATCH 25/25] update

---
 kamyu104/src/main.rs                            | 2 +-
 kamyu104/src/maximum_product_of_word_lengths.rs | 6 +++---
 2 files changed, 4 insertions(+), 4 deletions(-)

diff --git a/kamyu104/src/main.rs b/kamyu104/src/main.rs
index e821b08..5c1a2ae 100644
--- a/kamyu104/src/main.rs
+++ b/kamyu104/src/main.rs
@@ -1,4 +1,5 @@
 mod bitwise_and_of_numbers_range;
+mod maximum_product_of_word_lengths;
 mod missing_number;
 mod number_of_1_bits;
 mod power_of_two;
@@ -6,5 +7,4 @@ mod reverse_bits;
 mod single_number;
 mod single_number_ii;
 mod single_number_iii;
-mod maximum_product_of_word_lengths;
 mod template;
diff --git a/kamyu104/src/maximum_product_of_word_lengths.rs b/kamyu104/src/maximum_product_of_word_lengths.rs
index 9d86c2a..e4890b0 100644
--- a/kamyu104/src/maximum_product_of_word_lengths.rs
+++ b/kamyu104/src/maximum_product_of_word_lengths.rs
@@ -11,8 +11,8 @@ mod tests {
 
     #[test]
     fn test_max_product() {
-        assert_max_product!(Solution::max_product(vec!["abcw","baz","foo","bar","xtfn","abcdef"]), 16);
-        assert_max_product!(Solution::max_product(vec!["a","ab","abc","d","cd","bcd","abcd"]), 4);
-        assert_max_product!(Solution::max_product(vec!["a","aa","aaa","aaaa"]), 0);
+        // assert_max_product!(Solution::max_product(vec!["abcw","baz","foo","bar","xtfn","abcdef"]), 16);
+        // assert_max_product!(Solution::max_product(vec!["a","ab","abc","d","cd","bcd","abcd"]), 4);
+        // assert_max_product!(Solution::max_product(vec!["a","aa","aaa","aaaa"]), 0);
     }
 }