Added solution of problem 153

Author: kurpenok

src/solutions/mod.rs

@@ -88,6 +88,7 @@ pub mod s0148_sort_list;
 pub mod s0150_evaluate_reverse_polish_notation;
 pub mod s0151_reverse_words_in_a_string;
 pub mod s0152_maximum_product_subarray;
+pub mod s0153_find_minimum_in_rotated_sorted_array;
 pub mod s0231_power_of_two;
 pub mod s0232_implement_queue_using_stacks;
 pub mod s0234_palindrome_linked_list;

src/solutions/s0153_find_minimum_in_rotated_sorted_array.rs

@@ -0,0 +1,23 @@
+pub fn find_min(nums: Vec<i32>) -> i32 {
+    *nums.iter().min().unwrap()
+}
+
+#[cfg(test)]
+mod test {
+    use super::*;
+
+    #[test]
+    fn test_case_1() {
+        assert_eq!(find_min(vec![3, 4, 5, 1, 2]), 1);
+    }
+
+    #[test]
+    fn test_case_2() {
+        assert_eq!(find_min(vec![4, 5, 6, 7, 0, 1, 2]), 0);
+    }
+
+    #[test]
+    fn test_case_3() {
+        assert_eq!(find_min(vec![11, 13, 15, 17]), 11);
+    }
+}