반응형 Problem Solving/리트코드44 [리트코드 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. [리트코드 leetcode] 617. Merge Two Binary Trees leetcode.com/problems/merge-two-binary-trees/ Merge Two Binary Trees - 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.. 2021. 4. 12. [리트코드 leetcode] 687. Longest Univalue Path leetcode.com/problems/longest-univalue-path/ Longest Univalue Path - 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 c.. 2021. 4. 12. [리트코드 leetcode] 104. Maximum Depth of Binary Tree leetcode.com/problems/maximum-depth-of-binary-tree/ Maximum Depth of 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.r.. 2021. 4. 12. 이전 1 2 3 4 5 6 7 8 다음 반응형
