๋ฐ์ํ
[LeetCode] 96. Unique Binary Search Trees (Java)
์์ค ์ฝ๋๋ ์ฌ๊ธฐ ์์ต๋๋ค. ๋ฌธ์ ๋ ์ฌ๊ธฐ ์์ต๋๋ค. Problem Given an integer n, return the number of structurally unique BST's (binary search trees) which has exactly n nodes of unique values from 1 to n. Example 1: 1 1 2 3 3 \ \ / \ / / 3 2 1 3 2 1 / \ / \ 2 3 1 2 Input: n = 3 Output: 5 Example 2: Input: n = 1 Output: 1 Constraints: 1
Algorithm/LeetCode Daily Challenge
2021. 9. 3. 03:12
๋ฐ์ํ
๊ณต์ง์ฌํญ
์ต๊ทผ์ ์ฌ๋ผ์จ ๊ธ
์ต๊ทผ์ ๋ฌ๋ฆฐ ๋๊ธ
- Total
- 105,853
- Today
- 47
- Yesterday
- 392
๋งํฌ
TAG
- Spring Data JPA
- ์๊ณ ๋ฆฌ์ฆ
- JSON
- ์คํ๋ง ๋ฐ์ดํฐ jpa
- ํจ๊ป ์๋ผ๊ธฐ
- Spring Boot JPA
- ์คํ๋ง ๋ถํธ ํํ ๋ฆฌ์ผ
- spring boot application
- ์คํ๋ง๋ถํธ
- ์คํ๋ง ๋ถํธ ์ ํ๋ฆฌ์ผ์ด์
- spring boot jwt
- ํฅ์ฌ๊ณ ๋ ์ํคํ ์ฒ
- proto3
- spring boot app
- JPA
- intellij
- Linux
- Jackson
- ํด๋ฆฐ ์ํคํ ์ฒ
- Spring Boot Tutorial
- ํจ๊ป ์๋ผ๊ธฐ ํ๊ธฐ
- ์คํ๋ง ๋ถํธ
- Java
- Spring Boot
- gRPC
- @ManyToOne
- r
- leetcode
- QueryDSL
- ์คํ๋ง ๋ถํธ ํ์ ๊ฐ์