Added solution of problem 152

Author: kurpenok

src/solutions/mod.rs

@@ -87,6 +87,7 @@ pub mod s0147_insertion_sort_list;
 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 s0231_power_of_two;
 pub mod s0232_implement_queue_using_stacks;
 pub mod s0234_palindrome_linked_list;

src/solutions/s0152_maximum_product_subarray.rs

@@ -0,0 +1,32 @@
+pub fn max_product(nums: Vec<i32>) -> i32 {
+    let mut min_prod: i32 = nums[0];
+    let mut max_prod: i32 = nums[0];
+    let mut result: i32 = nums[0];
+
+    for (_, value) in nums.iter().enumerate().skip(1) {
+        let test_max_prod: i32 = max_prod * *value;
+        let test_min_prod: i32 = min_prod * *value;
+
+        max_prod = test_min_prod.max(test_max_prod).max(*value);
+        min_prod = test_max_prod.min(test_min_prod).min(*value);
+
+        result = result.max(max_prod);
+    }
+
+    result
+}
+
+#[cfg(test)]
+mod test {
+    use super::*;
+
+    #[test]
+    fn test_case_1() {
+        assert_eq!(max_product(vec![2, 3, -2, 4]), 6);
+    }
+
+    #[test]
+    fn test_case_2() {
+        assert_eq!(max_product(vec![-2, 0, -1]), 0);
+    }
+}