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,740
- Today
- 103
- Yesterday
- 133
๋งํฌ
TAG
- Linux
- ์คํ๋ง ๋ถํธ
- QueryDSL
- ์คํ๋ง ๋ถํธ ํ์ ๊ฐ์
- Spring Boot
- Jackson
- ์คํ๋ง๋ถํธ
- JSON
- ์คํ๋ง ๋ถํธ ์ ํ๋ฆฌ์ผ์ด์
- ์๊ณ ๋ฆฌ์ฆ
- ์คํ๋ง ๋ฐ์ดํฐ jpa
- leetcode
- ์คํ๋ง ๋ถํธ jwt
- gRPC
- r
- leetcode binary search
- spring boot application
- Java
- intellij
- spring boot app
- ์คํ๋ง ๋ถํธ ์น ์ ํ๋ฆฌ์ผ์ด์
- Spring Data JPA
- JPA
- spring boot jwt
- Spring Boot Tutorial
- leetcode stack
- proto3
- ๋๋ฉ์ธ ์ค๊ณ
- leetcode bst
- ์คํ๋ง ๋ถํธ ํํ ๋ฆฌ์ผ