LeetCode/cs/two-sum-ii-input-array-is-sorted.cs

public class Solution {
    public int[] TwoSum(int[] numbers, int target) {
        var (i, j) = (0, numbers.Length - 1);

        while (i < j && numbers[i] + numbers[j] != target) {
            if (numbers[i] + numbers[j] < target) {
                ++i;
            } else {
                --j;
            }
        }

        return new int[] { i + 1, j + 1 };
    }
}