fix: code

Author: yanglbme

solution/0900-0999/0993.Cousins in Binary Tree/README.md

@@ -157,7 +157,7 @@ public:
         queue<pair<TreeNode*, TreeNode*>> q;
         q.push({root, nullptr});
         int d1 = 0, d2 = 0;
-        TreeNode* p1 = nullptr, *p2 = nullptr;
+        TreeNode *p1 = nullptr, *p2 = nullptr;
         for (int depth = 0; q.size(); ++depth) {
             for (int n = q.size(); n; --n) {
                 auto [node, parent] = q.front();

solution/0900-0999/0993.Cousins in Binary Tree/README_EN.md

@@ -141,7 +141,7 @@ public:
         queue<pair<TreeNode*, TreeNode*>> q;
         q.push({root, nullptr});
         int d1 = 0, d2 = 0;
-        TreeNode* p1 = nullptr, *p2 = nullptr;
+        TreeNode *p1 = nullptr, *p2 = nullptr;
         for (int depth = 0; q.size(); ++depth) {
             for (int n = q.size(); n; --n) {
                 auto [node, parent] = q.front();

solution/0900-0999/0993.Cousins in Binary Tree/Solution.cpp

@@ -15,7 +15,7 @@ class Solution {
         queue<pair<TreeNode*, TreeNode*>> q;
         q.push({root, nullptr});
         int d1 = 0, d2 = 0;
-        TreeNode* p1 = nullptr, *p2 = nullptr;
+        TreeNode *p1 = nullptr, *p2 = nullptr;
         for (int depth = 0; q.size(); ++depth) {
             for (int n = q.size(); n; --n) {
                 auto [node, parent] = q.front();