refactor 100

fishercoder1534 · fishercoder1534 · commit 3c20ac84e212 · 2017-09-06T08:09:57.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_100.java b/src/main/java/com/fishercoder/solutions/_100.java
@@ -4,18 +4,17 @@
 
 /**
  * 100. Same Tree
- * <p>
  * Given two binary trees, write a function to check if they are equal or not.
- * <p>
  * Two binary trees are considered equal if they are structurally identical and the nodes have the same value.
  */
 
 public class _100 {
-    //recursion idea flows out naturally.
+
     public boolean isSameTree(TreeNode p, TreeNode q) {
         if (p == null || q == null) {
             return p == q;
         }
         return p.val == q.val && isSameTree(p.left, q.left) && isSameTree(p.right, q.right);
     }
+
 }

Original file line number	Diff line number	Diff line change
`@@ -4,18 +4,17 @@`
`4`	`4`
`5`	`5`	`/**`
`6`	`6`	`* 100. Same Tree`
`7`		`- * <p>`
`8`	`7`	`* Given two binary trees, write a function to check if they are equal or not.`
`9`		`- * <p>`
`10`	`8`	`* Two binary trees are considered equal if they are structurally identical and the nodes have the same value.`
`11`	`9`	`*/`
`12`	`10`
`13`	`11`	`public class _100 {`
`14`		`- //recursion idea flows out naturally.`
	`12`	`+`
`15`	`13`	`public boolean isSameTree(TreeNode p, TreeNode q) {`
`16`	`14`	`if (p == null \|\| q == null) {`
`17`	`15`	`return p == q;`
`18`	`16`	`}`
`19`	`17`	`return p.val == q.val && isSameTree(p.left, q.left) && isSameTree(p.right, q.right);`
`20`	`18`	`}`
	`19`	`+`
`21`	`20`	`}`