Commit ff4410a

committed

Update solutions

1 parent a26042a commit ff4410aCopy full SHA for ff4410a

File tree

+69

-0

lines changed

+69

-0

lines changed

Lines changed: 13 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,13 @@`
	`1`	`+import 'package:leetcode/tree/tree_node.dart';`
	`2`	`+`
	`3`	`+bool isSameTree(TreeNode? p, TreeNode? q) {`
	`4`	`+ if (p == null && q == null) {`
	`5`	`+ return true;`
	`6`	`+ }`
	`7`	`+`
	`8`	`+ if (p?.val != q?.val) {`
	`9`	`+ return false;`
	`10`	`+ }`
	`11`	`+`
	`12`	`+ return isSameTree(p?.left, q?.left) && isSameTree(p?.right, q?.right);`
	`13`	`+}`

Lines changed: 18 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,18 @@`
	`1`	`+import 'package:leetcode/tree/tree_node.dart';`
	`2`	`+`
	`3`	`+bool isSymmetric(TreeNode? root) {`
	`4`	`+ bool areChildrenSymmetric(TreeNode? p, TreeNode? q) {`
	`5`	`+ if (p == null && q == null) {`
	`6`	`+ return true;`
	`7`	`+ }`
	`8`	`+`
	`9`	`+ if (p?.val != q?.val) {`
	`10`	`+ return false;`
	`11`	`+ }`
	`12`	`+`
	`13`	`+ return areChildrenSymmetric(p?.left, q?.right) &&`
	`14`	`+ areChildrenSymmetric(p?.right, q?.left);`
	`15`	`+ }`
	`16`	`+`
	`17`	`+ return areChildrenSymmetric(root?.left, root?.right);`
	`18`	`+}`

Lines changed: 23 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,23 @@`
	`1`	`+import 'package:leetcode/leetcode.dart';`
	`2`	`+import 'package:leetcode/tree/is_same_tree.dart';`
	`3`	`+import 'package:test/test.dart';`
	`4`	`+`
	`5`	`+void main() {`
	`6`	`+ test('example 1', () {`
	`7`	`+ var p = TreeNode.fromList([1, 2, 3]);`
	`8`	`+ var q = TreeNode.fromList([1, 2, 3]);`
	`9`	`+ expect(isSameTree(p, q), equals(true));`
	`10`	`+ });`
	`11`	`+`
	`12`	`+ test('example 2', () {`
	`13`	`+ var p = TreeNode.fromList([1, 2]);`
	`14`	`+ var q = TreeNode.fromList([1, null, 2]);`
	`15`	`+ expect(isSameTree(p, q), equals(false));`
	`16`	`+ });`
	`17`	`+`
	`18`	`+ test('example 3', () {`
	`19`	`+ var p = TreeNode.fromList([1, 2, 1]);`
	`20`	`+ var q = TreeNode.fromList([1, 1, 2]);`
	`21`	`+ expect(isSameTree(p, q), equals(false));`
	`22`	`+ });`
	`23`	`+}`

Lines changed: 15 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,15 @@`
	`1`	`+import 'package:leetcode/leetcode.dart';`
	`2`	`+import 'package:leetcode/tree/is_symmetric.dart';`
	`3`	`+import 'package:test/test.dart';`
	`4`	`+`
	`5`	`+void main() {`
	`6`	`+ test('example 1', () {`
	`7`	`+ var root = TreeNode.fromList([1, 2, 2, 3, 4, 4, 3]);`
	`8`	`+ expect(isSymmetric(root), equals(true));`
	`9`	`+ });`
	`10`	`+`
	`11`	`+ test('example 2', () {`
	`12`	`+ var root = TreeNode.fromList([1, 2, 2, null, 3, null, 3]);`
	`13`	`+ expect(isSymmetric(root), equals(false));`
	`14`	`+ });`
	`15`	`+}`

Comments

(0)