목록알고리즘/LeetCode (177)

소프트웨어에 대한 모든 것

LeetCode 풀기 - 532. K-diff Pairs in an Array

532. K-diff Pairs in an Array https://leetcode.com/problems/k-diff-pairs-in-an-array/ K-diff Pairs in an Array - 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(n) class Solution: def findPairs(self, nums: List[int], k: int) -> int: counter = Counter(nums) res ..
알고리즘/LeetCode 2022. 2. 9. 22:42
LeetCode 풀기 - 258. Add Digits

258. Add Digits https://leetcode.com/problems/add-digits/ Add Digits - 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) Straight-forward class Solution: def addDigits(self, num: int) -> int: num_to_sumnum = lambda num: sum(int(n) for n in str(num)) while True: num = num_to..
알고리즘/LeetCode 2022. 2. 8. 20:27
LeetCode 풀기 - 454. 4Sum II

454. 4Sum II https://leetcode.com/problems/4sum-ii/ 4Sum 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 문제) 솔루션1) brute-force O(n^4)으로 풀었더니 역시나 TLE(Time Limit Exceeded) 발생합니다. class Solution: def fourSumCount(self, nums1: List[int], nums2: List[int], nums3: List[int], nums4: ..
알고리즘/LeetCode 2022. 2. 7. 21:18
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
Prev 1 ··· 7 8 9 10 11 12 13 ··· 23 Next