[DAY 27] Truck tour
Suppose there is a circle. There are N petrol pumps on that circle. Petrol pumps are numbered 0 to (N - 1) (both inclusive). You have two pieces of information corresponding to each of the petrol pump: (1) the amount of petrol that particular petrol pump will give, and (2) the distance from that petrol pump to the next petrol pump. Initially, you have a tank of infinite capacity carrying no petr..
1Day 1Algorithm
2019. 10. 27. 23:32
공지사항
최근에 올라온 글
최근에 달린 댓글
- Total
- Today
- Yesterday
링크
TAG
- 자바스크립트
- reduce()
- 컴퓨터공학
- 시분할시스템
- 구간합
- React
- Props
- redux-saga
- 우아한테크러닝
- 운영체제
- 1day1algorithm
- Array
- Algorithm
- 배열
- javascript
- 자료구조
- sort
- Webpack
- sort()
- 웹팩
- greedyAlgorithm
- 타입스크립트
- OS
- 리액트
- Typescript
- 배치처리시스템
- 멀티프로그래밍
- js
- 알고리즘
- 프로그래머스
| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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 |
글 보관함