Commit74ef4e4

committed

update: 95

1 parent0df24de commit74ef4e4Copy full SHA for 74ef4e4

File tree

+46

-0

lines changed

+46

-0

lines changed

Lines changed: 1 addition & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -66,6 +66,7 @@ This is the solutions collection of my LeetCode submissions, most of them are pr`
`66`	`66`	`\| 91\|[Decode Ways](https://leetcode.com/problems/decode-ways/)\|[JavaScript](./src/decode-ways/res.js)\| Medium\|`
`67`	`67`	`\| 93\|[Restore IP Addresses](https://leetcode.com/problems/restore-ip-addresses/)\|[JavaScript](./src/restore-ip-addresses/res.js)\| Medium\|`
`68`	`68`	`\| 94\|[Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal/)\|[TypeScript](./src/binary-tree-inorder-traversal/res.ts)\| Easy\|`
	`69`	`+\| 95\|[unique-binary-search-trees-ii](https://leetcode.com/problems/unique-binary-search-trees-ii/)\|[TypeScript](./src/unique-binary-search-trees-ii/res.ts)\| Medium\|`
`69`	`70`	`\| 96\|[unique-binary-search-trees](https://leetcode.com/problems/unique-binary-search-trees/)\|[TypeScript](./src/unique-binary-search-trees/res.ts)\| Medium\|`
`70`	`71`	`\| 97\|[interleaving-string](https://leetcode.com/problems/interleaving-string/)\|[TypeScript](./src/interleaving-string/res.ts)\| Medium\|`
`71`	`72`	`\| 98\|[Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/)\|[JavaScript](./src/validate-binary-search-tree/res.js)\| Medium\|`

Lines changed: 45 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,45 @@`
	`1`	`+/**`
	`2`	`+ * Definition for a binary tree node.`
	`3`	`+ * class TreeNode {`
	`4`	`+ * val: number`
	`5`	`+ * left: TreeNode \| null`
	`6`	`+ * right: TreeNode \| null`
	`7`	`+ * constructor(val?: number, left?: TreeNode \| null, right?: TreeNode \| null) {`
	`8`	`+ * this.val = (val===undefined ? 0 : val)`
	`9`	`+ * this.left = (left===undefined ? null : left)`
	`10`	`+ * this.right = (right===undefined ? null : right)`
	`11`	`+ * }`
	`12`	`+ * }`
	`13`	`+ */`
	`14`	`+`
	`15`	`+functiongetTrees(nums:number[]):Array<TreeNode\|null>{`
	`16`	`+if(!nums.length){`
	`17`	`+return[null];`
	`18`	`+}`
	`19`	`+`
	`20`	`+constresult=[];`
	`21`	`+`
	`22`	`+for(leti=0;i<nums.length;i++){`
	`23`	`+constcurrentVal=nums[i];`
	`24`	`+`
	`25`	`+constleftTrees=getTrees(nums.slice(0,i));`
	`26`	`+constrightTrees=getTrees(nums.slice(i+1));`
	`27`	`+`
	`28`	`+for(letj=0;j<leftTrees.length;j++){`
	`29`	`+for(letk=0;k<rightTrees.length;k++){`
	`30`	`+constrootNode=newTreeNode(currentVal);`
	`31`	`+rootNode.left=leftTrees[j];`
	`32`	`+rootNode.right=rightTrees[k];`
	`33`	`+result.push(rootNode);`
	`34`	`+}`
	`35`	`+}`
	`36`	`+}`
	`37`	`+`
	`38`	`+returnresult.filter(Boolean);`
	`39`	`+}`
	`40`	`+`
	`41`	`+functiongenerateTrees(n:number):Array<TreeNode\|null>{`
	`42`	`+constnums=newArray(n).fill(0).map((_,i)=>i+1);`
	`43`	`+`
	`44`	`+returngetTrees(nums);`
	`45`	`+};`

Comments

(0)