Commit be6fe18

committed

update: 101

1 parent a76b835 commit be6fe18Copy full SHA for be6fe18

File tree

+22

-0

lines changed

+22

-0

lines changed

Lines changed: 1 addition & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -52,6 +52,7 @@ This is the solutions collection of my LeetCode submissions, most of them are pr`
`52`	`52`	`\|88\|[ Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/) \| [JavaScript](./src/merge-sorted-array/res.js)\|Medium\|`
`53`	`53`	`\|91\|[Decode Ways](https://leetcode.com/problems/decode-ways/) \| [JavaScript](./src/decode-ways/res.js)\|Medium\|`
`54`	`54`	`\|93\|[Restore IP Addresses](https://leetcode.com/problems/restore-ip-addresses/) \| [JavaScript](./src/restore-ip-addresses/res.js)\|Medium\|`
	`55`	`+\|101\|[Symmetric Tree](https://leetcode.com/problems/symmetric-tree/) \| [JavaScript](./src/symmetric-tree/res.js)\|Easy\|`
`55`	`56`	`\|120\|[Triangle](https://leetcode.com/problems/triangle/) \| [JavaScript](./src/triangle/res.js)\|Medium\|`
`56`	`57`	`\|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\|`
`57`	`58`	`\|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: 21 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,21 @@`
	`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 {boolean}`
	`11`	`+ */`
	`12`	`+var isSymmetric = function(root) {`
	`13`	`+ const isMirror = (t1, t2) => {`
	`14`	`+ if (t1 == null && t2 == null) return true;`
	`15`	`+ if (t1 == null \|\| t2 == null) return false;`
	`16`	`+`
	`17`	`+ return t1.val === t2.val && isMirror(t1.left, t2.right) && isMirror(t1.right, t2.left);`
	`18`	`+ }`
	`19`	`+`
	`20`	`+ return isMirror(root, root);`
	`21`	`+};`

Comments

(0)