2154. Keep Multiplying Found Values by Two: AC

Author: tan-wei

src/solution/mod.rs

@@ -1627,3 +1627,4 @@ mod s2148_count_elements_with_strictly_smaller_and_greater_elements;
 mod s2149_rearrange_array_elements_by_sign;
 mod s2150_find_all_lonely_numbers_in_the_array;
 mod s2151_maximum_good_people_based_on_statements;
+mod s2154_keep_multiplying_found_values_by_two;

src/solution/s2154_keep_multiplying_found_values_by_two.rs

@@ -0,0 +1,82 @@
+/**
+ * [2154] Keep Multiplying Found Values by Two
+ *
+ * You are given an array of integers nums. You are also given an integer original which is the first number that needs to be searched for in nums.
+ * You then do the following steps:
+ * <ol>
+ * 	If original is found in nums, multiply it by two (i.e., set original = 2 * original).
+ * 	Otherwise, stop the process.
+ * 	Repeat this process with the new number as long as you keep finding the number.
+ * </ol>
+ * Return the final value of original.
+ *  
+ * Example 1:
+ *
+ * Input: nums = [5,3,6,1,12], original = 3
+ * Output: 24
+ * Explanation:
+ * - 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.
+ * - 24 is not found in nums. Thus, 24 is returned.
+ *
+ * Example 2:
+ *
+ * Input: nums = [2,7,9], original = 4
+ * Output: 4
+ * Explanation:
+ * - 4 is not found in nums. Thus, 4 is returned.
+ *
+ *  
+ * Constraints:
+ *
+ * 	1 <= nums.length <= 1000
+ * 	1 <= nums[i], original <= 1000
+ *
+ */
+pub struct Solution {}
+
+// problem: https://leetcode.com/problems/keep-multiplying-found-values-by-two/
+// discuss: https://leetcode.com/problems/keep-multiplying-found-values-by-two/discuss/?currentPage=1&orderBy=most_votes&query=
+
+// submission codes start here
+
+impl Solution {
+    pub fn find_final_value(nums: Vec<i32>, original: i32) -> i32 {
+        let mut nums = nums;
+        nums.sort_unstable();
+        nums.into_iter().fold(original, |mut acc, num| {
+            if num == acc {
+                acc <<= 1
+            }
+            acc
+        })
+    }
+}
+
+// submission codes end
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    fn test_2154_example_1() {
+        let nums = vec![5, 3, 6, 1, 12];
+        let original = 3;
+
+        let result = 24;
+
+        assert_eq!(Solution::find_final_value(nums, original), result);
+    }
+
+    #[test]
+    fn test_2154_example_2() {
+        let nums = vec![2, 7, 9];
+        let original = 4;
+
+        let result = 4;
+
+        assert_eq!(Solution::find_final_value(nums, original), result);
+    }
+}