목록python Leetcode (53)

소프트웨어에 대한 모든 것

LeetCode 풀기 - 895. Maximum Frequency Stack

895. Maximum Frequency Stack https://leetcode.com/problems/maximum-frequency-stack/ Maximum Frequency Stack - 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) 시간 초과 발생 시간 초과가 발생합니다. pop()을 수행할 때마다 sorted()로 정렬을 수행하기 때문에 너무 느립니다. push() 수행할 때 이미 정렬을 수행해 놓고 pop()에서는 O(1)으로 가..
알고리즘/LeetCode 2022. 3. 19. 23:01
LeetCode 풀기 - 2120. Execution of All Suffix Instructions Staying in a Grid

2120. Execution of All Suffix Instructions Staying in a Grid https://leetcode.com/problems/execution-of-all-suffix-instructions-staying-in-a-grid/ Execution of All Suffix Instructions Staying in a Grid - 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 시간복잡도 : ..
알고리즘/LeetCode 2022. 3. 10. 21:41
LeetCode 풀기 - 413. Arithmetic Slices

413. Arithmetic Slices https://leetcode.com/problems/arithmetic-slices/ Arithmetic Slices - 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 numberOfArithmeticSlices(self, nums: List[int]) -> int: """ Time Complexity : O(N^2) Space Complexity : O(1) """..
알고리즘/LeetCode 2022. 3. 9. 22:24
LeetCode 풀기 - 2181. Merge Nodes in Between Zeros

2181. Merge Nodes in Between Zeros https://leetcode.com/problems/merge-nodes-in-between-zeros/ 문제) 솔루션1) # Definition for singly-linked list. # class ListNode: # def __init__(self, val=0, next=None): # self.val = val # self.next = next class Solution: def mergeNodes(self, head): cur = head.next cur_sum = 0 res = [] while cur: if cur.val == 0: res.append(cur_sum) cur_sum = 0 else: cur_sum += cur...
알고리즘/LeetCode 2022. 3. 4. 21:19
LeetCode 풀기 - 287. Find the Duplicate Number

287. Find the Duplicate Number https://leetcode.com/problems/find-the-duplicate-number/ Find the Duplicate 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) 정렬 정렬한 다음에 순차적으로 중복된 숫자를 찾습니다. class Solution: def findDuplicate(self, nums): nums = sorted(nums) for i in r..
알고리즘/LeetCode 2022. 3. 2. 20:10
LeetCode 풀기 - 64. Minimum Path Sum

64. Minimum Path Sum https://leetcode.com/problems/minimum-path-sum/ Minimum Path Sum - 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) iterative Bottom-up 방식으로 풀어 나갑니다. 먼저 0행을 초기화합니다. 0열을 초기화합니다. 이제 m-1행, n-1을 향해서 순차적으로 채워나갑니다. 채워 나갈 때 최소 sum을 구하면서 채워 나갑니다. 예를 들어 grid[1]..
알고리즘/LeetCode 2022. 2. 28. 14:56
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 풀기 - 2169. Count Operations to Obtain Zero

2169. Count Operations to Obtain Zero https://leetcode.com/problems/count-operations-to-obtain-zero/ Count Operations to Obtain Zero - 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 countOperations(self, num1: int, num2: int) -> int: ..
알고리즘/LeetCode 2022. 2. 26. 09:38
Prev 1 2 3 4 ··· 7 Next