목록알고리즘 (194)

소프트웨어에 대한 모든 것

LeetCode 풀기 - 965. Univalued Binary Tree

965. Univalued Binary Tree https://leetcode.com/problems/univalued-binary-tree/ Univalued 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 문제) 솔루션1) Recursive # Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, right=None): # s..
알고리즘/LeetCode 2022. 1. 15. 20:47
LeetCode 풀기 - 1022. Sum of Root To Leaf Binary Numbers

1022. Sum of Root To Leaf Binary Numbers https://leetcode.com/problems/sum-of-root-to-leaf-binary-numbers/ Sum of Root To Leaf Binary Numbers - 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 문제) 솔루션1) 재귀 # Definition for a binary tree node. # class TreeNode: # def __init__(self, v..
알고리즘/LeetCode 2022. 1. 11. 20:36
LeetCode 풀기 - 382. Linked List Random Node

382. Linked List Random Node https://leetcode.com/problems/linked-list-random-node/ Linked List Random Node - 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 문제) 솔루션1) 리스트를 배열로 저장 시간복잡도 : O(1) 공간복잡도 : O(n) # Definition for singly-linked list. # class ListNode: # def __init__(self, ..
알고리즘/LeetCode 2022. 1. 11. 06:24
LeetCode 풀기 - 67. Add Binary

67. Add Binary https://leetcode.com/problems/add-binary/ Add Binary - 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 문제) 솔루션1) 직접 계산 class Solution: def addBinary(self, a: str, b: str) -> str: a = list(map(int, a)) b = list(map(int, b)) res = '' carry = 0 while a or b or carry: if..
알고리즘/LeetCode 2022. 1. 10. 21:29
LeetCode 풀기 - 1094. Car Pooling

1094. Car Pooling https://leetcode.com/problems/car-pooling/ Car Pooling - 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 문제) 솔루션1) class Solution(object): def carPooling(self, trips, capacity): """ :type trips: List[List[int]] :type capacity: int :rtype: bool """ d = defaultdict(..
알고리즘/LeetCode 2022. 1. 7. 07:20
LeetCode 풀기 - 997. Find the Town Judge

997. Find the Town Judge https://leetcode.com/problems/find-the-town-judge/ Find the Town Judge - 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 문제) 솔루션1) 문제 설명: 1) 타운 판사는 아무도 믿지 않는다 2) 타운 판사를 제외하고 모든 사람은 타운 판사를 믿지 않는다 1)과 2) 조건을 만족하는 사람은 딱 한 명 있다 class Solution: def findJudge(sel..
알고리즘/LeetCode 2022. 1. 4. 21:23
LeetCode 풀기 - 1026. Maximum Difference Between Node and Ancestor

1026. Maximum Difference Between Node and Ancestor https://leetcode.com/problems/maximum-difference-between-node-and-ancestor/ Maximum Difference Between Node and Ancestor - 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 문제) 솔루션1) Recursive Consistency is a key!!! 2021년 마지막 문제 풀이입..
알고리즘/LeetCode 2021. 12. 31. 20:48
LeetCode 풀기 - 559. Maximum Depth of N-ary Tree

559. Maximum Depth of N-ary Tree https://leetcode.com/problems/maximum-depth-of-n-ary-tree/ Maximum Depth of N-ary 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 문제) 솔루션1) recursive """ # Definition for a Node. class Node: def __init__(self, val=None, children=None): self.v..
알고리즘/LeetCode 2021. 12. 31. 07:10
Prev 1 ··· 9 10 11 12 13 14 15 ··· 25 Next