Notice
Recent Posts
Recent Comments
일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
Tags
- github
- AI 경진대회
- PYTHON
- Git
- 자연어처리
- 데이콘
- hackerrank
- gs25
- 편스토랑
- 백준
- Kaggle
- ubuntu
- dacon
- 맥북
- 우분투
- 코로나19
- ChatGPT
- 더현대서울 맛집
- Baekjoon
- 캐치카페
- Docker
- programmers
- 프로그래머스 파이썬
- 파이썬
- Real or Not? NLP with Disaster Tweets
- 편스토랑 우승상품
- 금융문자분석경진대회
- SW Expert Academy
- 프로그래머스
- leetcode
Archives
- Today
- Total
목록
반응형
2020/05/27 (1)
반응형
솜씨좋은장씨
[HackerRank] Stock Maximize (Python)
Your algorithms have become so good at predicting the market that you now know what the share price of Wooden Orange Toothpicks Inc. (WOT) will be for the next number of days. Each day, you can either buy one share of WOT, sell any number of shares of WOT that you own, or not make any transaction at all. What is the maximum profit you can obtain with an optimum trading strategy? For example, if ..
Programming/코딩 1일 1문제
2020. 5. 27. 17:23
반응형