11/20/2020

Author: safrannn

Cargo.lock

@@ -6,4 +6,5 @@ edition = "2018"
 
 [dependencies]
 leetcode_prelude = "0.2"
-rustgym = "0.1.1"
+rustgym = "0.1.1"
+rand = "0.7.3"

Cargo.toml

@@ -15,7 +15,7 @@ impl Solution {
         let mut result: Vec<i32> = vec![];
         for (n1, o1) in map_1 {
             if let Some(&o2) = map_2.get(&n1.clone()) {
-                for i in 0..o1.min(o2) {
+                for _i in 0..o1.min(o2) {
                     result.push(n1.clone());
                 }
             }

src/_0350_intersection_of_two_arrays_ii.rs

@@ -0,0 +1,30 @@
+struct Solution;
+
+impl Solution {
+    pub fn lexical_order(n: i32) -> Vec<i32> {
+        let mut result = vec![];
+        Self::dfs(0, n, &mut result);
+        result
+    }
+
+    fn dfs(current: i32, n: i32, result: &mut Vec<i32>) {
+        if current > n {
+            return;
+        }
+        for i in 0..10 {
+            let temp = current * 10 + i;
+            if temp != 0 && temp <= n {
+                result.push(temp);
+                Self::dfs(temp, n, result);
+            }
+        }
+    }
+}
+
+#[test]
+fn test() {
+    assert_eq!(
+        Solution::lexical_order(13),
+        vec![1, 10, 11, 12, 13, 2, 3, 4, 5, 6, 7, 8, 9]
+    );
+}

src/_0386_lexicographical_numbers.rs

@@ -0,0 +1,20 @@
+struct Solution;
+
+use rand::distributions::Uniform;
+use rand::thread_rng;
+use rand::Rng;
+
+impl Solution {
+    pub fn rand10() -> i32 {
+        let mut i = 50;
+        while i > 40 {
+            i = (Self::rand7() - 1) * 7 + Self::rand7();
+        }
+        (i - 1) % 10 + 1
+    }
+    fn rand7() -> i32 {
+        let distribution: Uniform<i32> = Uniform::new(0, 7);
+        let mut rng = thread_rng();
+        rng.sample(distribution) + 1
+    }
+}

src/_0470_implement_rand10_using_rand7.rs

@@ -2,7 +2,7 @@ struct Solution;
 
 impl Solution {
     pub fn sorted_squares(mut a: Vec<i32>) -> Vec<i32> {
-        a.iter_mut().for_each(|mut s| {
+        a.iter_mut().for_each(|s| {
             *s *= *s;
         });
         a.sort();

src/_0977_squares_of_a_sorted_array.rs

@@ -154,6 +154,8 @@ mod _0371_sum_of_two_integers;
 //
 mod _0383_ransom_note;
 //
+mod _0386_lexicographical_numbers;
+//
 mod _0387_first_unique_character_in_a_string;
 //
 mod _0394_decode_string;
@@ -168,6 +170,8 @@ mod _0443_string_compression;
 //
 mod _0448_find_all_numbers_disappeared_in_an_array;
 //
+mod _0470_implement_rand10_using_rand7;
+//
 mod _0496_next_greater_element_i;
 //
 mod _0503_next_greater_element_ii;