fix: update

Author: yanglbme

solution/2000-2099/2096.Step-By-Step Directions From a Binary Tree Node to Another/README.md

@@ -469,7 +469,8 @@ class Solution {
         dfs(root, startValue, pathToStart);
         dfs(root, destValue, pathToDest);
         int i = 0;
-        while (i < pathToStart.length() && i < pathToDest.length() && pathToStart.charAt(i) == pathToDest.charAt(i)) {
+        while (i < pathToStart.length() && i < pathToDest.length()
+            && pathToStart.charAt(i) == pathToDest.charAt(i)) {
             ++i;
         }
         return "U".repeat(pathToStart.length() - i) + pathToDest.substring(i);

solution/2000-2099/2096.Step-By-Step Directions From a Binary Tree Node to Another/README_EN.md

@@ -465,7 +465,8 @@ class Solution {
         dfs(root, startValue, pathToStart);
         dfs(root, destValue, pathToDest);
         int i = 0;
-        while (i < pathToStart.length() && i < pathToDest.length() && pathToStart.charAt(i) == pathToDest.charAt(i)) {
+        while (i < pathToStart.length() && i < pathToDest.length()
+            && pathToStart.charAt(i) == pathToDest.charAt(i)) {
             ++i;
         }
         return "U".repeat(pathToStart.length() - i) + pathToDest.substring(i);

solution/2000-2099/2096.Step-By-Step Directions From a Binary Tree Node to Another/Solution2.java

@@ -5,7 +5,8 @@ public String getDirections(TreeNode root, int startValue, int destValue) {
         dfs(root, startValue, pathToStart);
         dfs(root, destValue, pathToDest);
         int i = 0;
-        while (i < pathToStart.length() && i < pathToDest.length() && pathToStart.charAt(i) == pathToDest.charAt(i)) {
+        while (i < pathToStart.length() && i < pathToDest.length()
+            && pathToStart.charAt(i) == pathToDest.charAt(i)) {
             ++i;
         }
         return "U".repeat(pathToStart.length() - i) + pathToDest.substring(i);