목록python 알고리즘 (17)

소프트웨어에 대한 모든 것

LeetCode 풀기 - 662. Maximum Width of Binary Tree

662. Maximum Width of Binary Tree https://leetcode.com/problems/maximum-width-of-binary-tree/ Maximum Width 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 문제) 솔루션1) 재귀 문제에 대한 이해를 확실히 하지 못해서 많이 헤맸습니다. 문제가 원하는 바를 다시 정리하자면, "바이너리 트리에서 모든 레벨에서의 최대 폭을 리턴하는 것'입니다. 문제를 해..
알고리즘/LeetCode 2022. 2. 27. 11:56
LeetCode 풀기 - 200. Number of Islands

200. Number of Islands https://leetcode.com/problems/number-of-islands/ Number of Islands - 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) DFS class Solution(object): def numIslands(self, grid): """ :type grid: List[List[str]] :rtype: int """ m,n = len(grid), len(grid[0]..
알고리즘/LeetCode 2022. 2. 23. 19:37
LeetCode 풀기 - 692. Top K Frequent Words

692. Top K Frequent Words https://leetcode.com/problems/top-k-frequent-words/ Top K Frequent Words - 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) sorted() 다중 정렬 sorted() 함수의 다중 정렬을 사용하면 문제를 쉽게 해결할 수 있습니다. class Solution(object): def topKFrequent(self, words, k): """ :t..
알고리즘/LeetCode 2022. 2. 23. 18:30
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 풀기 - 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 풀기 - 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 풀기 - 1356. Sort Integers by The Number of 1 Bits

1356. Sort Integers by The Number of 1 Bits https://leetcode.com/problems/sort-integers-by-the-number-of-1-bits/ Sort Integers by The Number of 1 Bits - 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 sortByBits(self, arr: List[int]) -> List[int]: d = ..
알고리즘/LeetCode 2021. 12. 29. 20:18
540. Single Element in a Sorted Array

540. Single Element in a Sorted Array https://leetcode.com/problems/single-element-in-a-sorted-array/ Single Element in a Sorted 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) - hash 사용 단 하나의 elemnt를 제외하고 모든 원소들은 두 번 등장합니다. hash 자료구조에 처음 나오는 element를 저장하고, 두 번째 등..
알고리즘/LeetCode 2021. 12. 28. 06:23
Prev 1 2 3 Next