feat: update lc problems (doocs#2185)

Author: acbin

lcci/16.04.Tic-Tac-Toe/README.md

@@ -77,7 +77,12 @@ class Solution:
                     dg += v
                 if i + j + 1 == n:
                     udg += v
-                if abs(rows[i]) == n or abs(cols[j]) == n or abs(dg) == n or abs(udg) == n:
+                if (
+                    abs(rows[i]) == n
+                    or abs(cols[j]) == n
+                    or abs(dg) == n
+                    or abs(udg) == n
+                ):
                     return c
         return 'Pending' if has_empty_grid else 'Draw'
 ```

lcci/16.04.Tic-Tac-Toe/README_EN.md

@@ -85,7 +85,12 @@ class Solution:
                     dg += v
                 if i + j + 1 == n:
                     udg += v
-                if abs(rows[i]) == n or abs(cols[j]) == n or abs(dg) == n or abs(udg) == n:
+                if (
+                    abs(rows[i]) == n
+                    or abs(cols[j]) == n
+                    or abs(dg) == n
+                    or abs(udg) == n
+                ):
                     return c
         return 'Pending' if has_empty_grid else 'Draw'
 ```

solution/0000-0099/0002.Add Two Numbers/Solution.php

@@ -44,4 +44,4 @@ function addTwoNumbers($l1, $l2) {
 
         return $dummy->next;
     }
-}
+}

solution/0000-0099/0003.Longest Substring Without Repeating Characters/Solution.php

@@ -21,4 +21,4 @@ function lengthOfLongestSubstring($s) {
         }
         return $max;
     }
-}
+}

solution/0100-0199/0100.Same Tree/Solution.php

@@ -27,7 +27,6 @@ function isSameTree($p, $q) {
         if ($p->val != $q->val) {
             return false;
         }
-        return $this->isSameTree($p->left, $q->left) &&
-            $this->isSameTree($p->right, $q->right);
+        return $this->isSameTree($p->left, $q->left) && $this->isSameTree($p->right, $q->right);
     }
 }

solution/0100-0199/0105.Construct Binary Tree from Preorder and Inorder Traversal/README.md

@@ -249,7 +249,7 @@ public:
         for (int i = 0; i < n; ++i) {
             d[inOrder[i]].push_back(i);
         }
-        function<vector<TreeNode*>(int, int, int)> dfs = [&](int i,int j, int n) -> vector<TreeNode*> {
+        function<vector<TreeNode*>(int, int, int)> dfs = [&](int i, int j, int n) -> vector<TreeNode*> {
             vector<TreeNode*> ans;
             if (n <= 0) {
                 ans.push_back(nullptr);

solution/0100-0199/0105.Construct Binary Tree from Preorder and Inorder Traversal/README_EN.md

@@ -239,7 +239,7 @@ public:
         for (int i = 0; i < n; ++i) {
             d[inOrder[i]].push_back(i);
         }
-        function<vector<TreeNode*>(int, int, int)> dfs = [&](int i,int j, int n) -> vector<TreeNode*> {
+        function<vector<TreeNode*>(int, int, int)> dfs = [&](int i, int j, int n) -> vector<TreeNode*> {
             vector<TreeNode*> ans;
             if (n <= 0) {
                 ans.push_back(nullptr);

solution/0100-0199/0175.Combine Two Tables/README_EN.md

@@ -102,7 +102,6 @@ def combine_two_tables(person: pd.DataFrame, address: pd.DataFrame) -> pd.DataFr
     return pd.merge(left=person, right=address, how="left", on="personId")[
         ["firstName", "lastName", "city", "state"]
     ]
-
 ```
 
 <!-- tabs:end -->

solution/0100-0199/0181.Employees Earning More Than Their Managers/README_EN.md

@@ -88,7 +88,6 @@ def find_employees(employee: pd.DataFrame) -> pd.DataFrame:
     emp = df[df["salary_x"] > df["salary_y"]]["name_x"]
 
     return pd.DataFrame({"Employee": emp})
-
 ```
 
 <!-- tabs:end -->

solution/0100-0199/0185.Department Top Three Salaries/README.md

@@ -162,7 +162,6 @@ def top_three_salaries(
     return employee[employee["salary"] >= employee["cutoff"]].rename(
         columns={"name": "Employee", "salary": "Salary"}
     )[["Department", "Employee", "Salary"]]
-
 ```
 
 <!-- tabs:end -->