refactor 101

fishercoder1534 · fishercoder1534 · commit 76d1b4922dc3 · 2020-01-22T07:01:29.000-08:00
diff --git a/src/main/java/com/fishercoder/solutions/_101.java b/src/main/java/com/fishercoder/solutions/_101.java
@@ -2,7 +2,8 @@
 
 import com.fishercoder.common.classes.TreeNode;
 
-/**101. Symmetric Tree
+/**
+ * 101. Symmetric Tree
 
 Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).
 
@@ -39,10 +40,7 @@ private boolean isSymmetric(TreeNode left, TreeNode right) {
 			if (left == null || right == null) {
 				return left == right;
 			}
-			if (left.val != right.val) {
-				return false;
-			}
-			return isSymmetric(left.left, right.right) && isSymmetric(left.right, right.left);
+			return left.val == right.val && isSymmetric(left.left, right.right) && isSymmetric(left.right, right.left);
 		}
 	}
 }

Original file line number	Diff line number	Diff line change
`@@ -2,7 +2,8 @@`
`2`	`2`
`3`	`3`	`import com.fishercoder.common.classes.TreeNode;`
`4`	`4`
`5`		`-/**101. Symmetric Tree`
	`5`	`+/**`
	`6`	`+ * 101. Symmetric Tree`
`6`	`7`
`7`	`8`	`Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).`
`8`	`9`
`@@ -39,10 +40,7 @@ private boolean isSymmetric(TreeNode left, TreeNode right) {`
`39`	`40`	`if (left == null \|\| right == null) {`
`40`	`41`	`return left == right;`
`41`	`42`	`}`
`42`		`- if (left.val != right.val) {`
`43`		`- return false;`
`44`		`- }`
`45`		`- return isSymmetric(left.left, right.right) && isSymmetric(left.right, right.left);`
	`43`	`+ return left.val == right.val && isSymmetric(left.left, right.right) && isSymmetric(left.right, right.left);`
`46`	`44`	`}`
`47`	`45`	`}`
`48`	`46`	`}`