[DAY 8] Greedy Florist
A group of friends wants to buy a bouquet of flowers. The florist wants to maximize his number of new customers and the money he makes. To do this, he decides he'll multiply the price of each flower by the number of that customer's previously purchased flowers plus 1. The first flower will be original price, (0 + 1) * original price, the next will be (1 + 1) * original price and so on. Given the..
1Day 1Algorithm
2019. 10. 8. 18:33
공지사항
최근에 올라온 글
최근에 달린 댓글
- Total
- Today
- Yesterday
링크
TAG
- 프로그래머스
- sort
- javascript
- Typescript
- 자료구조
- 자바스크립트
- Algorithm
- 운영체제
- Webpack
- Props
- sort()
- 멀티프로그래밍
- 타입스크립트
- 배치처리시스템
- 웹팩
- 구간합
- reduce()
- greedyAlgorithm
- 1day1algorithm
- js
- redux-saga
- 알고리즘
- 배열
- 컴퓨터공학
- 리액트
- Array
- OS
- 시분할시스템
- 우아한테크러닝
- React
| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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 |
글 보관함