feat: add rust solution to lc problem: No.2154

Author: yanglbme

solution/2100-2199/2154.Keep Multiplying Found Values by Two/README.md

@@ -40,7 +40,7 @@ tags:
 <pre>
 <strong>输入：</strong>nums = [5,3,6,1,12], original = 3
 <strong>输出：</strong>24
-<strong>解释：</strong> 
+<strong>解释：</strong>
 - 3 能在 nums 中找到。3 * 2 = 6 。
 - 6 能在 nums 中找到。6 * 2 = 12 。
 - 12 能在 nums 中找到。12 * 2 = 24 。
@@ -152,6 +152,22 @@ function findFinalValue(nums: number[], original: number): number {
 }
 ```
 
+#### Rust
+
+```rust
+impl Solution {
+    pub fn find_final_value(nums: Vec<i32>, original: i32) -> i32 {
+        use std::collections::HashSet;
+        let s: HashSet<i32> = nums.into_iter().collect();
+        let mut original = original;
+        while s.contains(&original) {
+            original <<= 1;
+        }
+        original
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/2100-2199/2154.Keep Multiplying Found Values by Two/README_EN.md

@@ -39,7 +39,7 @@ tags:
 <pre>
 <strong>Input:</strong> nums = [5,3,6,1,12], original = 3
 <strong>Output:</strong> 24
-<strong>Explanation:</strong> 
+<strong>Explanation:</strong>
 - 3 is found in nums. 3 is multiplied by 2 to obtain 6.
 - 6 is found in nums. 6 is multiplied by 2 to obtain 12.
 - 12 is found in nums. 12 is multiplied by 2 to obtain 24.
@@ -150,6 +150,22 @@ function findFinalValue(nums: number[], original: number): number {
 }
 ```
 
+#### Rust
+
+```rust
+impl Solution {
+    pub fn find_final_value(nums: Vec<i32>, original: i32) -> i32 {
+        use std::collections::HashSet;
+        let s: HashSet<i32> = nums.into_iter().collect();
+        let mut original = original;
+        while s.contains(&original) {
+            original <<= 1;
+        }
+        original
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/2100-2199/2154.Keep Multiplying Found Values by Two/Solution.rs

@@ -0,0 +1,11 @@
+impl Solution {
+    pub fn find_final_value(nums: Vec<i32>, original: i32) -> i32 {
+        use std::collections::HashSet;
+        let s: HashSet<i32> = nums.into_iter().collect();
+        let mut original = original;
+        while s.contains(&original) {
+            original <<= 1;
+        }
+        original
+    }
+}