목록알고리즘 (194)

소프트웨어에 대한 모든 것

LeetCode 풀기 - 171. Excel Sheet Column Number

171. Excel Sheet Column Number https://leetcode.com/problems/excel-sheet-column-number/ Excel Sheet Column 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 문제) 솔루션1) 26진수 풀이 class Solution: def titleToNumber(self, columnTitle: str) -> int: res = 0 columnTitle = columnTitle[..
알고리즘/LeetCode 2022. 2. 22. 21:36
LeetCode 풀기 - 169. Majority Element

169. Majority Element https://leetcode.com/problems/majority-element/ Majority Element - 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 majorityElement(self, nums: List[int]) -> int: half = len(nums)//2 counter = Counter(nums) for n, count in counter...
알고리즘/LeetCode 2022. 2. 22. 06:13
LeetCode 풀기 - 1288. Remove Covered Intervals

1288. Remove Covered Intervals https://leetcode.com/problems/remove-covered-intervals/ Remove Covered Intervals - 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 removeCoveredIntervals(self, nums: List[List[int]]) -> int: count = len(nums) # 오름차순 정렬 nu..
알고리즘/LeetCode 2022. 2. 20. 21:14
LeetCode 풀기 - 104. Maximum Depth of Binary Tree

104. Maximum Depth of Binary Tree https://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 문제) 솔루션1) DFS # Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, r..
알고리즘/LeetCode 2022. 2. 15. 08:32
LeetCode 풀기 - 389. Find the Difference

389. Find the Difference https://leetcode.com/problems/find-the-difference/ Find the Difference - 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) HashMap 각각의 해쉬맵 구성. 원래 문자의 hashmap에서 random 생성된 문자 해쉬맵을 하나씩 제거해나가서 최종적으로 남은 것이 추가된 문자가됩니다. class Solution: def findTheDifferen..
알고리즘/LeetCode 2022. 2. 9. 22:59
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
Prev 1 ··· 8 9 10 11 12 13 14 ··· 25 Next