Commitbbf9d03

committed

clean up code

1 parent4e45fb2 commitbbf9d03Copy full SHA for bbf9d03

File tree

-13

lines changed

-13

lines changed

Lines changed: 0 additions & 12 deletions

Original file line number	Diff line number	Diff line change
`@@ -9,18 +9,6 @@`
`9`	`9`	`*@param {TreeNode} root`
`10`	`10`	`*@return {number}`
`11`	`11`	`*/`
`12`		`-// not accepted!!`
`13`		`-varmaxDepth=function(root){`
`14`		`-if(root===null){return0;}`
`15`		`-if(maxDepth(root.left)>maxDepth(root.right)){`
`16`		`-root=root.left;`
`17`		`-}else{`
`18`		`-root=root.right;`
`19`		`-}`
`20`		`-returnmaxDepth(root)+1;`
`21`		`-};`
`22`		`-`
`23`		`-// accepted`
`24`	`12`	`varmaxDepth=function(root){`
`25`	`13`	`varmax=0;`
`26`	`14`	`varlmax=maxDepth(root.left);`

Lines changed: 1 addition & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -41,6 +41,7 @@ var mergeTwoLists = function(l1, l2) {`
`41`	`41`	`};`
`42`	`42`
`43`	`43`	`// discard first dummy node in the new list which contains the merged result.`
	`44`	`+// this is good and straightforward`
`44`	`45`	`varmergeTwoLists=function(l1,l2){`
`45`	`46`	`varl3=newListNode();`
`46`	`47`	`varl3Head=l3;`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -14,7 +14,7 @@ var isPalindrome = function(x) {`
`14`	`14`	`};`
`15`	`15`
`16`	`16`	`// 2nd solution`
`17`		`-//it is slower than 1st solution, however, it only needs to examine half of the number`
	`17`	`+//It only needs to examine half of the number`
`18`	`18`	`// just be careful if the number is has factor 10`
`19`	`19`	`// also a good solution in case overflow happens`
`20`	`20`	`varisPalindrome=function(x){`

Comments

(0)