목록Dynamic Programming (1)
삼촌 공부
[Leetcode]96. Unique Binary Search Trees
Question leetcode 92번. unique binary search tree의 갯수를 구하는 문제 https://leetcode.com/problems/unique-binary-search-trees/ Given n, how many structurally unique BST's (binary search trees) that store values 1 ... n? Example: Input: 3 Output: 5 Explanation: Given n = 3, there are a total of 5 unique BST's: 1 3 3 2 1 \ / / / \ \ 3 2 1 1 3 2 / / \ \ 2 1 2 3 Constraints: 1
알고리즘
2020. 9. 11. 23:59