Commit50ed227

committed

提供JavaScript版本的《将有序数组转换为二叉搜索树》

1 parente2d8c0a commit50ed227Copy full SHA for 50ed227

File tree

+30

-0

lines changed

+30

-0

lines changed

Lines changed: 30 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -279,6 +279,36 @@ func sortedArrayToBST(nums []int) *TreeNode {`
`279`	`279`	`}`
`280`	`280`	```
`281`	`281`
	`282`	`+JavaScript版本`
	`283`	`+`
	`284`	+```javascript
	`285`	`+/**`
	`286`	`+ * Definition for a binary tree node.`
	`287`	`+ * function TreeNode(val, left, right) {`
	`288`	`+ * this.val = (val===undefined ? 0 : val)`
	`289`	`+ * this.left = (left===undefined ? null : left)`
	`290`	`+ * this.right = (right===undefined ? null : right)`
	`291`	`+ * }`
	`292`	`+ */`
	`293`	`+/**`
	`294`	`+ * @param {number[]} nums`
	`295`	`+ * @return {TreeNode}`
	`296`	`+ */`
	`297`	`+var sortedArrayToBST = function (nums) {`
	`298`	`+ const buildTree = (Arr, left, right) => {`
	`299`	`+ if (left > right)`
	`300`	`+ return null;`
	`301`	`+`
	`302`	`+ let mid = Math.floor(left + (right - left) / 2);`
	`303`	`+`
	`304`	`+ let root = new TreeNode(Arr[mid]);`
	`305`	`+ root.left = buildTree(Arr, left, mid - 1);`
	`306`	`+ root.right = buildTree(Arr, mid + 1, right);`
	`307`	`+ return root;`
	`308`	`+ }`
	`309`	`+ return buildTree(nums, 0, nums.length - 1);`
	`310`	`+};`
	`311`	+```
`282`	`312`
`283`	`313`
`284`	`314`

Comments

(0)