일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
1 | 2 | 3 | ||||
4 | 5 | 6 | 7 | 8 | 9 | 10 |
11 | 12 | 13 | 14 | 15 | 16 | 17 |
18 | 19 | 20 | 21 | 22 | 23 | 24 |
25 | 26 | 27 | 28 | 29 | 30 | 31 |
- Python
- Knowledge Distillation
- 임계처리
- flame
- center loss
- Computer Vision
- attention
- point cloud
- 알고리즘
- re-identification
- numpy
- transformer
- Object Detection
- 논문 구현
- 스택
- Object Tracking
- OpenCV
- cv2
- 자료구조
- Threshold
- Deeplearning
- 3D
- 큐
- NLP
- deep learning
- 프로그래머스
- level2
- reconstruction
- 딥러닝
- 파이썬
- Today
- Total
목록큐 (2)
공돌이 공룡의 서재

from math import ceil def solution(progresses, speeds): answer = [] #1 period = [ceil((100-progresses[i])/speeds[i]) for i in range(len(progresses)-1, -1, -1)] #2 release = [] elapse = period.pop() release.append(elapse) #3 while len(period) > 0: work = period.pop() if elapse < work: answer.append(len(release)) release = [] period.append(work) elapse = work else: release.append(work) answer.appe..

def solution2(prices: list): answer = [] ##1 price = prices[::-1] time = 0 delay = price.copy() _ = delay.pop() ##2 while len(delay) > 0: time += 1 now = price.pop() later = delay.pop() # print(now, price) # print(later, delay) if now > later: ## 3-1 answer.append(1) else: ## 3-2 flag = False for i in range(1, len(price)): if now > price[-i - 1]: flag = True answer.append(i + 1) break if not fla..