fix: fix 101

Blankj · Blankj · commit 4981f7b0bf06 · 2017-12-27T21:26:06.000+08:00
diff --git a/note/101/README.md b/note/101/README.md
@@ -47,13 +47,13 @@ Bonus points if you could solve it both recursively and iteratively.
  */
 class Solution {
     public boolean isSymmetric(TreeNode root) {
-        return root == null || isSymmetricHelper(root.left, root.right);
+        return root == null || helper(root.left, root.right);
     }
 
     public boolean helper(TreeNode left, TreeNode right) {
         if (left == null || right == null) return left == right;
         if (left.val != right.val) return false;
-        return isSymmetricHelper(left.left, right.right) && isSymmetricHelper(left.right, right.left);
+        return helper(left.left, right.right) && helper(left.right, right.left);
     }
 }
 ```
diff --git a/src/com/blankj/easy/_101/Solution.java b/src/com/blankj/easy/_101/Solution.java
@@ -15,13 +15,13 @@
  */
 public class Solution {
 //    public boolean isSymmetric(TreeNode root) {
-//        return root == null || isSymmetricHelper(root.left, root.right);
+//        return root == null || helper(root.left, root.right);
 //    }
 //
 //    private boolean helper(TreeNode left, TreeNode right) {
 //        if (left == null || right == null) return left == right;
 //        if (left.val != right.val) return false;
-//        return isSymmetricHelper(left.left, right.right) && isSymmetricHelper(left.right, right.left);
+//        return helper(left.left, right.right) && helper(left.right, right.left);
 //    }
 
     public boolean isSymmetric(TreeNode root) {

Original file line number	Diff line number	Diff line change
`@@ -47,13 +47,13 @@ Bonus points if you could solve it both recursively and iteratively.`
`47`	`47`	`*/`
`48`	`48`	`class Solution {`
`49`	`49`	`public boolean isSymmetric(TreeNode root) {`
`50`		`- return root == null \|\| isSymmetricHelper(root.left, root.right);`
	`50`	`+ return root == null \|\| helper(root.left, root.right);`
`51`	`51`	`}`
`52`	`52`
`53`	`53`	`public boolean helper(TreeNode left, TreeNode right) {`
`54`	`54`	`if (left == null \|\| right == null) return left == right;`
`55`	`55`	`if (left.val != right.val) return false;`
`56`		`- return isSymmetricHelper(left.left, right.right) && isSymmetricHelper(left.right, right.left);`
	`56`	`+ return helper(left.left, right.right) && helper(left.right, right.left);`
`57`	`57`	`}`
`58`	`58`	`}`
`59`	`59`	```