[LeetCode] Two Sum II - Input array is sorted 파이썬

class Solution:
    def twoSum(self, numbers: List[int], target: int) -> List[int]:
        seen = {}
        for i, v in enumerate(numbers):
            remaining = target - v
            if remaining in seen:
                return [seen[remaining]+1, i+1]
            seen[v] = i
        return []

기존의 Two Sum 과 다른 점은 sorted array라는 점과 zero-indexed가 아니라 1-indexed이라는 점.