최근 포스트

[Programmers] 프린터

최대 1 분 소요

Python import collections def solution(priorities, location): answer = 0 q: deque = collections.deque([(v, i) for i, v in enumerate(priorities)]) ...

[Programmers] 기능개발

최대 1 분 소요

Python def solution(progresses, speeds): answer = [] day = 0 count = 0 while len(progresses) > 0: if progresses[0] + speeds[0...

[LeetCode] 234. Palindrome Linked List

최대 1 분 소요

Python # Definition for singly-linked list. # class ListNode: # def __init__(self, val=0, next=None): # self.val = val # self.next = next...