167. Two Sum II - Input array is sorted.py

class Solution(object):
    def twoSum(self, numbers, target):
        i = 0; j = len(numbers) - 1
        while i < j:
            sum = numbers[i] + numbers[j]
            if sum < target:
                i += 1
            elif sum > target:
                j -= 1
            else:
                return [i + 1, j + 1]