{ "type": "code_options", "author": "https://github.com/begeekmyfriend/leetcode", "source": "solution.md", "exercise_id": "b83b2c495c46406e8776d85e98306307", "keywords": "树,二叉搜索树,数学,动态规划,二叉树", "title": "不同的二叉搜索树", "desc": [ { "content": "\n
给你一个整数 n
,求恰由 n
个节点组成且节点值从 1
到 n
互不相同的 二叉搜索树\n有多少种?返回满足题意的二叉搜索树的种数。
", "language": "markdown" }, { "content": "\n
示例 1:
\n\n输入:n = 3\n输出:5\n", "language": "markdown" }, { "content": "\n
示例 2:
", "language": "markdown" }, { "content": "\n输入:n = 1\n输出:1\n", "language": "markdown" }, { "content": "\n
", "language": "markdown" }, { "content": "\n
提示:
", "language": "markdown" }, { "content": "\n1 <= n <= 19