Circle Deque (원형 덱) class MyCircularDeque: def __init__(self, k: int): self.q = [None] * (k+1) self.max = k+1 self.front = 0 self.rear = 0 def insert_front(self, value: int): if self.is_full(): print('Deque is Full') else: self.q[self.front] = value self.front = (self.front - 1 + self.max) % self.max def insert_last(self, value: int): if self.is_full(): print('Deque is Full') else: self.rear = (..

Leetcode 641. Design Circular Deque https://leetcode.com/problems/design-circular-deque/ Design Circular Deque - 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 Solution class MyCircularDeque: def __init__(self, k: int): self.q = [None] * (k+1) self.max = k+1 self.front = 0 self.re..

Leetcode 622. Design Circular Queue (3) Design Circular Queue - LeetCode Design Circular Queue - 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 Solution class MyCircularQueue: def __init__(self, k: int): self.q = [None] * (k+1) self.max = k + 1 self.front = 0 self.rear = 0 def enQ..

Leetcode 232 (3) Implement Queue using Stacks - LeetCode Implement Queue using Stacks - 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 Solution class MyQueue: def __init__(self): self.stack = [] def push(self, x: int) -> None: self.stack.append(x) def pop(self) -> int: front = sel..

Leetcode 225. Implement Stack using Queues (3) Implement Stack using Queues - LeetCode Implement Stack using Queues - 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 Solution from collections import deque class MyStack: def __init__(self): self.q = collections.deque() def push(self..

Leetcode 739. Daily Temperatures Daily Temperatures - 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 Solution class Solution: def dailyTemperatures(self, T: List[int]) -> List[int]: stack = [] result = [0]*len(T) for i, n in enumerate(T): while stack and n > T[stack[-1]]: top = st..