Update 2096.Step-By-Step-Directions-From-a-Binary-Tree-Node-to-Another.cpp

wisdompeak · web-flow · commit 4487405fcfc6 · 2021-12-13T04:46:54.000-08:00
diff --git a/Tree/2096.Step-By-Step-Directions-From-a-Binary-Tree-Node-to-Another/2096.Step-By-Step-Directions-From-a-Binary-Tree-Node-to-Another.cpp b/Tree/2096.Step-By-Step-Directions-From-a-Binary-Tree-Node-to-Another/2096.Step-By-Step-Directions-From-a-Binary-Tree-Node-to-Another.cpp
@@ -14,16 +14,13 @@ class Solution {
     string getDirections(TreeNode* root, int startValue, int destValue) 
     {
         vector<int>nums1, nums2;        
-        nums1.push_back(root->val);
-        nums2.push_back(root->val);
         string dirs1, dirs2;
         dfs(root, nums1, dirs1, startValue);
         dfs(root, nums2, dirs2, destValue);
 
         int k = 0;
         while (k<nums1.size() && k<nums2.size() && nums1[k]==nums2[k])
             k++;
-        k--;
         for (int i=k; i<dirs1.size(); i++) dirs1[i] = 'U';
         return dirs1.substr(k)+dirs2.substr(k);
         
