this week

Author: BowMonkey

Cargo.lock

@@ -1,14 +1,8 @@
 # My Leetcode Solution in Rust
 
-Run `cargo run {id}` to initialize the template submission file of "question #id".
+## forked from aylei/leetcode-rust
 
-Run `cargo test test_{id}` to test the solution for "question #id".
 
-对于大部分难度为 Hard 的问题, 会有中文的思路注释
-
-Working in progress, to do:
-
-- [ ] auto generation of solution list (when 100 problems solved)
 
 ## Usage
 

README.md

@@ -1,5 +1,4 @@
 #[macro_use]
 pub mod util;
 
-pub mod solution;
 pub mod problem;

leetcode-rust.exe

@@ -0,0 +1 @@
+mod p0268_missing_number;

src/lib.rs

@@ -0,0 +1,58 @@
+/**
+ * [268] Missing Number
+ *
+ * Given an array nums containing n distinct numbers in the range [0, n], return the only number in the range that is missing from the array.
+ *  
+ * <strong class="example">Example 1:
+ * 
+ * Input: nums = [3,0,1]
+ * Output: 2
+ * Explanation: n = 3 since there are 3 numbers, so all numbers are in the range [0,3]. 2 is the missing number in the range since it does not appear in nums.
+ * 
+ * <strong class="example">Example 2:
+ * 
+ * Input: nums = [0,1]
+ * Output: 2
+ * Explanation: n = 2 since there are 2 numbers, so all numbers are in the range [0,2]. 2 is the missing number in the range since it does not appear in nums.
+ * 
+ * <strong class="example">Example 3:
+ * 
+ * Input: nums = [9,6,4,2,3,5,7,0,1]
+ * Output: 8
+ * Explanation: n = 9 since there are 9 numbers, so all numbers are in the range [0,9]. 8 is the missing number in the range since it does not appear in nums.
+ * 
+ *  
+ * Constraints:
+ * 
+ * 	n == nums.length
+ * 	1 <= n <= 10^4
+ * 	0 <= nums[i] <= n
+ * 	All the numbers of nums are unique.
+ * 
+ *  
+ * Follow up: Could you implement a solution using only O(1) extra space complexity and O(n) runtime complexity?
+ * 
+ */
+pub struct Solution {}
+
+// problem: https://leetcode.com/problems/missing-number/
+// discuss: https://leetcode.com/problems/missing-number/discuss/?currentPage=1&orderBy=most_votes&query=
+
+// submission codes start here
+
+impl Solution {
+    pub fn missing_number(nums: Vec<i32>) -> i32 {
+        0
+    }
+}
+
+// submission codes end
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    fn test_268() {
+    }
+}