Added solution of problem 167

Author: kurpenok

src/solutions/mod.rs

@@ -93,6 +93,7 @@ pub mod s0155_min_stack;
 pub mod s0162_find_peak_element;
 pub mod s0164_maximum_gap;
 pub mod s0165_compare_version_numbers;
+pub mod s0167_two_sum_ii_input_array_is_sorted;
 pub mod s0231_power_of_two;
 pub mod s0232_implement_queue_using_stacks;
 pub mod s0234_palindrome_linked_list;

src/solutions/s0167_two_sum_ii_input_array_is_sorted.rs

@@ -0,0 +1,36 @@
+pub fn two_sum(numbers: Vec<i32>, target: i32) -> Vec<i32> {
+    let mut left: usize = 0;
+    let mut right: usize = numbers.len() - 1;
+
+    while left < right {
+        if numbers[left] + numbers[right] == target {
+            return vec![left as i32 + 1, right as i32 + 1];
+        } else if numbers[left] + numbers[right] > target {
+            right -= 1;
+        } else {
+            left += 1;
+        }
+    }
+
+    vec![]
+}
+
+#[cfg(test)]
+mod test {
+    use super::*;
+
+    #[test]
+    fn test_case_1() {
+        assert_eq!(two_sum(vec![2, 7, 11, 15], 9), [1, 2]);
+    }
+
+    #[test]
+    fn test_case_2() {
+        assert_eq!(two_sum(vec![2, 3, 4], 6), [1, 3]);
+    }
+
+    #[test]
+    fn test_case_3() {
+        assert_eq!(two_sum(vec![-1, 0], -1), [1, 2]);
+    }
+}