更正了错误代码

Author: carpeventus

code/offer/src/Chap7/LastSameInBST.java

@@ -17,9 +17,9 @@ public Node findLastSame(Node root, Node a, Node b) {
         Node cur = root;
         while (cur != null) {
             if (cur.val < a.val && cur.val < b.val) {
-                cur = cur.left;
-            } else if (cur.val > a.val && cur.val > b.val) {
                 cur = cur.right;
+            } else if (cur.val > a.val && cur.val > b.val) {
+                cur = cur.left;
             } else {
                 return cur;
             }

notes/剑指offer面试题68--树中两个结点的最低公共祖先.md

@@ -29,9 +29,9 @@ public class LastSameInBST {
         Node cur = root;
         while (cur != null) {
             if (cur.val < a.val && cur.val < b.val) {
-                cur = cur.left;
-            } else if (cur.val > a.val && cur.val > b.val) {
                 cur = cur.right;
+            } else if (cur.val > a.val && cur.val > b.val) {
+                cur = cur.left;
             } else {
                 return cur;
             }