Added solution of problem 162

Author: kurpenok

src/solutions/mod.rs

@@ -90,6 +90,7 @@ 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 s0155_min_stack;
+pub mod s0162_find_peak_element;
 pub mod s0231_power_of_two;
 pub mod s0232_implement_queue_using_stacks;
 pub mod s0234_palindrome_linked_list;

src/solutions/s0162_find_peak_element.rs

@@ -0,0 +1,32 @@
+pub fn find_peak_element(nums: Vec<i32>) -> i32 {
+    if nums.len() == 1 || nums[0] > nums[1] {
+        return 0;
+    }
+
+    if nums[nums.len() - 1] > nums[nums.len() - 2] {
+        return nums.len() as i32 - 1;
+    }
+
+    for i in 1..nums.len() - 1 {
+        if nums[i - 1] < nums[i] && nums[i] > nums[i + 1] {
+            return i as i32;
+        }
+    }
+
+    0
+}
+
+#[cfg(test)]
+mod test {
+    use super::*;
+
+    #[test]
+    fn test_case_1() {
+        assert_eq!(find_peak_element(vec![1, 2, 3, 1]), 2);
+    }
+
+    #[test]
+    fn test_case_2() {
+        assert_eq!(find_peak_element(vec![1, 2, 1, 3, 5, 6, 4]), 1);
+    }
+}