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
- programmers
- 더현대서울 맛집
- 금융문자분석경진대회
- AI 경진대회
- 캐치카페
- gs25
- Real or Not? NLP with Disaster Tweets
- 프로그래머스 파이썬
- Baekjoon
- 프로그래머스
- 편스토랑
- SW Expert Academy
- 파이썬
- Git
- hackerrank
- Docker
- dacon
- ubuntu
- Kaggle
- leetcode
- 편스토랑 우승상품
- 백준
- 맥북
- ChatGPT
- 데이콘
- 자연어처리
- 코로나19
- PYTHON
Archives
- Today
- Total
목록
반응형
121. Best Time to Buy and Sell Stock (1)
반응형
솜씨좋은장씨
[leetCode] 121. Best Time to Buy and Sell Stock (Python)
Say you have an array for which the ith element is the price of a given stock on day i. If you were only permitted to complete at most one transaction (i.e., buy one and sell one share of the stock), design an algorithm to find the maximum profit. Note that you cannot sell a stock before you buy one. Example 1: Input: [7,1,5,3,6,4] Output: 5 Explanation: Buy on day 2 (price = 1) and sell on day ..
Programming/코딩 1일 1문제
2020. 8. 13. 23:20
반응형