You are an expert in writing code in many different languages. Your goal is to perform code completion for the following code, keeping in mind the rest of the code and the file meta data.
    Metadata details:
    filename: 0167-two-sum-ii-input-array-is-sorted.rs
    path of file: ./repos/NeetCode-Solutions/02_Two_Pointers/02_Two_Sum_II_-_Input_Array_Is_Sorted
    
    the code of the file until where you have to start completion: /*
Problem: LeetCode 167 - Two Sum II - Input array is sorted

Key Idea:
The key idea is to use a two-pointer approach to find the two numbers that add up to the target sum.

Approach:
1. Initialize two pointers, `left` at the start of the array and `right` at the end.
2. While `left` is less than `right`:
   - Calcu
    
    pub fn two_sum(numbers: Vec<i32>, target: i32) -> Vec<i32> {
        let mut left = 0;
        let mut right = numbers.len() - 1;

        while left < right {
            let sum = numbers[left] + numbers[right];

            if sum == target {
                return vec![(left + 1) as i32, (right + 1) as i32];
            } else if sum < target {
                left += 1;
            } else {
                right -= 1;
            }
        }

        vec![]
    }