Added solution of problem 164

Author: kurpenok

src/solutions/mod.rs

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

src/solutions/s0164_maximum_gap.rs

@@ -0,0 +1,30 @@
+pub fn maximum_gap(nums: Vec<i32>) -> i32 {
+    if nums.len() < 2 {
+        return 0;
+    }
+
+    let mut nums = nums;
+    nums.sort();
+
+    let mut result: i32 = 0;
+    for i in 1..nums.len() {
+        result = std::cmp::max(result, (nums[i - 1] - nums[i]).abs());
+    }
+
+    result
+}
+
+#[cfg(test)]
+mod test {
+    use super::*;
+
+    #[test]
+    fn test_case_1() {
+        assert_eq!(maximum_gap(vec![3, 6, 9, 1]), 3);
+    }
+
+    #[test]
+    fn test_case_2() {
+        assert_eq!(maximum_gap(vec![10]), 0);
+    }
+}