LeetCode 리트코드 ) Two Sum II - Input array is sorted (Python)

문제

풀이

class Solution:
    def twoSum(self, numbers: List[int], target: int) -> List[int]:        
        leftnum , rightnum = 0, len(numbers)-1
        
        while leftnum < rightnum :
            if(numbers[leftnum] + numbers[rightnum] == target):
                return [leftnum+1,rightnum+1]
            elif(numbers[leftnum] + numbers[rightnum] < target):
                leftnum += 1
            elif(numbers[leftnum] + numbers[rightnum] > target):
                rightnum -= 1
                
# sort 된 상태니까 값을 비교하면서, target보다 작으면 왼쪽을 크면 오른쪽을 하나씩 움직인다