167. Two Sum II - Input Array Is Sorted

https://leetcode.com/problems/two-sum-ii-input-array-is-sorted

Python

class Solution:
    def twoSum(self, numbers: List[int], target: int) -> List[int]:
        l, r = 0, len(numbers)-1

        while l < r:
            total = numbers[l] + numbers[r]
            if total == target:
                return [l+1, r+1]
            elif total < target:
                l += 1
            else:
                r -= 1

Go

func twoSum(numbers []int, target int) []int {
    l := 0
    r := len(numbers) - 1

    for l < r {
        sum := numbers[l] + numbers[r]

        if sum == target {
            return []int{l+1, r+1}
        } else if sum < target {
            l += 1
        } else {
            r -= 1
        }
    }
    return []int{}
}