728x90
๋ฐ์ํ
[LeetCode - Daily Challenge] 309. Best Time to Buy and Sell Stock with Cooldown
์์ค ์ฝ๋๋ ์ฌ๊ธฐ ์์ต๋๋ค. ๋ฌธ์ ๋ ์ฌ๊ธฐ ์์ต๋๋ค. Problem You are given an array prices where prices[i] is the price of a given stock on the ith day. Find the maximum profit you can achieve. You may complete as many transactions as you like (i.e., buy one and sell one share of the stock multiple times) with the following restrictions: After you sell your stock, you cannot buy stock on the next day (i.e., cooldown on..
Algorithm/LeetCode Daily Challenge
2021. 10. 18. 10:30
728x90
๋ฐ์ํ
๊ณต์ง์ฌํญ
์ต๊ทผ์ ์ฌ๋ผ์จ ๊ธ
์ต๊ทผ์ ๋ฌ๋ฆฐ ๋๊ธ
- Total
- 71,750
- Today
- 113
- Yesterday
- 133
๋งํฌ
TAG
- spring boot application
- JSON
- Spring Boot Tutorial
- spring boot app
- ์คํ๋ง ๋ถํธ ์น ์ ํ๋ฆฌ์ผ์ด์
- ์คํ๋ง ๋ถํธ jwt
- gRPC
- Spring Data JPA
- ์คํ๋ง ๋ถํธ ํํ ๋ฆฌ์ผ
- ์คํ๋ง ๋ถํธ
- ์๊ณ ๋ฆฌ์ฆ
- ์คํ๋ง ๋ถํธ ํ์ ๊ฐ์
- leetcode binary search
- intellij
- ์คํ๋ง ๋ถํธ ์ ํ๋ฆฌ์ผ์ด์
- proto3
- ๋๋ฉ์ธ ์ค๊ณ
- leetcode
- spring boot jwt
- Java
- Linux
- Spring Boot
- ์คํ๋ง๋ถํธ
- leetcode stack
- ์คํ๋ง ๋ฐ์ดํฐ jpa
- leetcode bst
- Jackson
- JPA
- QueryDSL
- r