style: format code

Author: yanglbme

solution/1900-1999/1993.Operations on Tree/Solution.cpp

@@ -9,23 +9,23 @@ class LockingTree {
             children[parent[i]].push_back(i);
         }
     }
-    
+
     bool lock(int num, int user) {
         if (locked[num] == -1) {
             locked[num] = user;
             return true;
         }
         return false;
     }
-    
+
     bool unlock(int num, int user) {
         if (locked[num] == user) {
             locked[num] = -1;
             return true;
         }
         return false;
     }
-    
+
     bool upgrade(int num, int user) {
         int x = num;
         while (x != -1) {

solution/1900-1999/1993.Operations on Tree/Solution.java

@@ -14,23 +14,23 @@ public LockingTree(int[] parent) {
             children[parent[i]].add(i);
         }
     }
-    
+
     public boolean lock(int num, int user) {
         if (locked[num] == -1) {
             locked[num] = user;
             return true;
         }
         return false;
     }
-    
+
     public boolean unlock(int num, int user) {
         if (locked[num] == user) {
             locked[num] = -1;
             return true;
         }
         return false;
     }
-    
+
     public boolean upgrade(int num, int user) {
         int x = num;
         while (x != -1) {