Commit37173fd

committed

update: 107

1 parentca696fa commit37173fdCopy full SHA for 37173fd

File tree

+55

-17

lines changed

README.md
src
- binary-tree-level-order-traversal-ii
  - res.js
- minimum-depth-of-binary-tree
  - res.js

+55

-17

lines changed

Lines changed: 1 addition & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -55,6 +55,7 @@ This is the solutions collection of my LeetCode submissions, most of them are pr`
`55`	`55`	`\|101\|[Symmetric Tree](https://leetcode.com/problems/symmetric-tree/)\|[JavaScript](./src/symmetric-tree/res.js)\|Easy\|`
`56`	`56`	`\|102\|[Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/)\|[JavaScript](./src/binary-tree-level-order-traversal/res.js)\|Medium\|`
`57`	`57`	`\|107\|[Binary Tree Level Order Traversal II](https://leetcode.com/problems/binary-tree-level-order-traversal-ii/)\|[JavaScript](./src/binary-tree-level-order-traversal-ii/res.js)\|Easy\|`
	`58`	`+\|111\|[Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree/)\|[JavaScript](./src/minimum-depth-of-binary-tree/res.js)\|Easy\|`
`58`	`59`	`\|120\|[Triangle](https://leetcode.com/problems/triangle/)\|[JavaScript](./src/triangle/res.js)\|Medium\|`
`59`	`60`	`\|121\|[Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/)\|[JavaScript](./src/best-time-to-buy-and-sell-stock/res.js)\|Easy\|`
`60`	`61`	`\|122\|[Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/)\|[JavaScript](./src/best-time-to-buy-and-sell-stock-ii/res.js)\|Easy\|`

Lines changed: 17 additions & 17 deletions

Original file line number	Diff line number	Diff line change
`@@ -7,31 +7,31 @@`
`7`	`7`	`*/`
`8`	`8`	`/**`
`9`	`9`	`*@param {TreeNode} root`
`10`		`- *@return {number}`
	`10`	`+ *@return {number[][]}`
`11`	`11`	`*/`
`12`		`-varminDepth=function(root){`
`13`		`-if(!root)return0;`
	`12`	`+varlevelOrderBottom=function(root){`
	`13`	`+if(!root)return[];`
`14`	`14`
`15`		`-letqueue=[root];`
`16`		`-letres=1;`
`17`		`-`
`18`		`-while(queue.length){`
	`15`	`+constgetDepthNodes=(queue)=>{`
`19`	`16`	`consttempQ=[];`
`20`		`-letisNull=false;`
`21`		`-`
	`17`	`+consttempR=[];`
`22`	`18`	`queue.map(e=>{`
`23`		`-if(!e.left&&!e.right)isNull=true;`
	`19`	`+if(e.val!==undefined)tempR.push(e.val);`
`24`	`20`
`25`		`-e.left&&tempQ.push(e.left);`
`26`		`-e.right&&tempQ.push(e.right);`
	`21`	`+if(e.left){`
	`22`	`+tempQ.push(e.left);`
	`23`	`+}`
	`24`	`+if(e.right){`
	`25`	`+tempQ.push(e.right);`
	`26`	`+}`
`27`	`27`	`});`
`28`		`-queue=tempQ;`
`29`		`-if(isNull){`
`30`		`-break;`
	`28`	`+`
	`29`	`+if(tempQ.length){`
	`30`	`+returngetDepthNodes(tempQ).concat([tempR]);`
`31`	`31`	`}else{`
`32`		`-res+=1;`
	`32`	`+return[tempR];`
`33`	`33`	`}`
`34`	`34`	`}`
`35`	`35`
`36`		`-returnres;`
	`36`	`+returngetDepthNodes([root]);`
`37`	`37`	`};`

Lines changed: 37 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,37 @@`
	`1`	`+/**`
	`2`	`+ * Definition for a binary tree node.`
	`3`	`+ * function TreeNode(val) {`
	`4`	`+ * this.val = val;`
	`5`	`+ * this.left = this.right = null;`
	`6`	`+ * }`
	`7`	`+ */`
	`8`	`+/**`
	`9`	`+ *@param {TreeNode} root`
	`10`	`+ *@return {number}`
	`11`	`+ */`
	`12`	`+varminDepth=function(root){`
	`13`	`+if(!root)return0;`
	`14`	`+`
	`15`	`+letqueue=[root];`
	`16`	`+letres=1;`
	`17`	`+`
	`18`	`+while(queue.length){`
	`19`	`+consttempQ=[];`
	`20`	`+letisNull=false;`
	`21`	`+`
	`22`	`+queue.map(e=>{`
	`23`	`+if(!e.left&&!e.right)isNull=true;`
	`24`	`+`
	`25`	`+e.left&&tempQ.push(e.left);`
	`26`	`+e.right&&tempQ.push(e.right);`
	`27`	`+});`
	`28`	`+queue=tempQ;`
	`29`	`+if(isNull){`
	`30`	`+break;`
	`31`	`+}else{`
	`32`	`+res+=1;`
	`33`	`+}`
	`34`	`+}`
	`35`	`+`
	`36`	`+returnres;`
	`37`	`+};`

Comments

(0)