목록파이썬 릿코드 (15)

소프트웨어에 대한 모든 것

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 풀기 - 2. Add Two Numbers

2. Add Two Numbers https://leetcode.com/problems/add-two-numbers/ Add Two 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) bruto-force 풀이 순서: 1) 리스트를 array 자료구조로 변환 2) carry를 계산하면서 각 자리수 add 3) 최종 결과물 array를 리스트로 변환해서 리턴 # Definition for singly-linked list. # cla..
알고리즘/LeetCode 2022. 3. 11. 06:33
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 풀기 - 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 풀기 - 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
Prev 1 2 Next