본문 바로가기
Problem Solving/리트코드

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

by ggyongi 2021. 4. 12.
반응형

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

 

Search a 2D Matrix II - LeetCode

Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview.

leetcode.com

 

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]
            
            
 

비전공자 네카라 신입 취업 노하우

시행착오 끝에 얻어낸 취업 노하우가 모두 담긴 전자책!

kmong.com

댓글