Commit cd361bc

committed

update: 100

1 parent a8fe2ed commit cd361bcCopy full SHA for cd361bc

File tree

+19

-0

lines changed

+19

-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`	`+\|100\|[Same Tree](https://leetcode.com/problems/same-tree/) \| [JavaScript](./src/same-tree/res.js)\|Easy\|`
`55`	`56`	`\|101\|[Symmetric Tree](https://leetcode.com/problems/symmetric-tree/) \| [JavaScript](./src/symmetric-tree/res.js)\|Easy\|`
`56`	`57`	`\|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`	`58`	`\|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\|`

Lines changed: 18 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,18 @@`
	`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} p`
	`10`	`+ * @param {TreeNode} q`
	`11`	`+ * @return {boolean}`
	`12`	`+ */`
	`13`	`+var isSameTree = function(p, q) {`
	`14`	`+ if (!p && !q) return true;`
	`15`	`+ if (!p \|\| !q) return false;`
	`16`	`+`
	`17`	`+ return p.val === q.val && isSameTree(p.left, q.left) && isSameTree(p.right, q.right);`
	`18`	`+};`

Comments

(0)