[리트코드 leetcode] 240. Search a 2D Matrix II

leetcode.com/problems/search-a-2d-matrix-ii/

Search a 2D Matrix II - LeetCode

 

class Solution:
    def twoSum(self, numbers: List[int], target: int) -> List[int]:
        dct={}
        
        for i in range(len(numbers)):
            dct[numbers[i]]=i
            
        
        for i in range(len(numbers)):
            p = target - numbers[i]
            if p in dct:
                return [i+1,dct[p]+1]