728x90
반응형
[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
728x90
반응형
1