반응형 전체 글571 [리트코드 leetcode] 240. Search a 2D Matrix II 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)): .. 2021. 4. 12. [리트코드 leetcode] 167. Two Sum II - Input array is sorted leetcode.com/problems/two-sum-ii-input-array-is-sorted/ Two Sum II - Input array is sorted - 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 .. 2021. 4. 12. [리트코드 leetcode] 349. Intersection of Two Arrays leetcode.com/problems/intersection-of-two-arrays/ Intersection of Two Arrays - 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 intersection(self, nums1: List[int], nums2: List[int]) -> List[int]: a=list(set(nums1)) b=list(set(nums2)) dct = collections.Counter(a+.. 2021. 4. 12. [리트코드 leetcode] 179. Largest Number leetcode.com/problems/largest-number/ Largest Number - 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 brilliant other person's solution! class Solution: def largestNumber(self, nums: List[int]) -> str: d=list(map(str,nums)) ##10번 반복한 문자열의 대소를 비교한다. 숫자는 10^9까지니까 10번반복 ##중요한 것은 문자열 .. 2021. 4. 12. [리트코드 leetcode] 108. Convert Sorted Array to Binary Search Tree leetcode.com/problems/convert-sorted-array-to-binary-search-tree/ Convert Sorted Array to Binary Search Tree - 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 # Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, right=None): # self.val = val.. 2021. 4. 12. [리트코드 leetcode] 110. Balanced Binary Tree leetcode.com/problems/balanced-binary-tree/ Balanced Binary Tree - 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 # Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, right=None): # self.val = val # self.left = left # self.right = right cla.. 2021. 4. 12. 이전 1 ··· 77 78 79 80 81 82 83 ··· 96 다음 반응형
