chore: update lc problems (doocs#4336)

Author: yanglbme

solution/0100-0199/0184.Department Highest Salary/Solution.py

@@ -17,4 +17,4 @@ def department_highest_salary(
     result = top_earners[['name_y', 'name_x', 'salary']].copy()
     result.columns = ['Department', 'Employee', 'Salary']
 
-    return result
+    return result

solution/0400-0499/0416.Partition Equal Subset Sum/README.md

@@ -202,14 +202,14 @@ impl Solution {
         let n = nums.len();
         let mut f = vec![vec![false; m + 1]; n + 1];
         f[0][0] = true;
-        
+
         for i in 1..=n {
             let x = nums[i - 1] as usize;
             for j in 0..=m {
                 f[i][j] = f[i - 1][j] || (j >= x && f[i - 1][j - x]);
             }
         }
-        
+
         f[n][m]
     }
 }

solution/0400-0499/0416.Partition Equal Subset Sum/README_EN.md

@@ -201,14 +201,14 @@ impl Solution {
         let n = nums.len();
         let mut f = vec![vec![false; m + 1]; n + 1];
         f[0][0] = true;
-        
+
         for i in 1..=n {
             let x = nums[i - 1] as usize;
             for j in 0..=m {
                 f[i][j] = f[i - 1][j] || (j >= x && f[i - 1][j - x]);
             }
         }
-        
+
         f[n][m]
     }
 }

solution/0400-0499/0416.Partition Equal Subset Sum/Solution.rs

@@ -8,14 +8,14 @@ impl Solution {
         let n = nums.len();
         let mut f = vec![vec![false; m + 1]; n + 1];
         f[0][0] = true;
-        
+
         for i in 1..=n {
             let x = nums[i - 1] as usize;
             for j in 0..=m {
                 f[i][j] = f[i - 1][j] || (j >= x && f[i - 1][j - x]);
             }
         }
-        
+
         f[n][m]
     }
 }

solution/0700-0799/0752.Open the Lock/Solution.py

@@ -17,7 +17,7 @@ def next(s):
         s = set(deadends)
         if '0000' in s:
             return -1
-        q = deque([('0000')])
+        q = deque(['0000'])
         s.add('0000')
         ans = 0
         while q:

solution/0700-0799/0752.Open the Lock/Solution2.py

@@ -27,7 +27,7 @@ def extend(m1, m2, q):
 
         def bfs():
             m1, m2 = {"0000": 0}, {target: 0}
-            q1, q2 = deque([('0000')]), deque([(target)])
+            q1, q2 = deque(['0000']), deque([target])
             while q1 and q2:
                 t = extend(m1, m2, q1) if len(q1) <= len(q2) else extend(m2, m1, q2)
                 if t != -1:

solution/0700-0799/0773.Sliding Puzzle/Solution.py

@@ -29,7 +29,7 @@ def f():
         if start == end:
             return 0
         vis = {start}
-        q = deque([(start)])
+        q = deque([start])
         ans = 0
         while q:
             ans += 1

solution/1200-1299/1237.Find Positive Integer Solution for a Given Equation/Solution.py

@@ -1,11 +1,11 @@
 """
-   This is the custom function interface.
-   You should not implement it, or speculate about its implementation
-   class CustomFunction:
-       # Returns f(x, y) for any given positive integers x and y.
-       # Note that f(x, y) is increasing with respect to both x and y.
-       # i.e. f(x, y) < f(x + 1, y), f(x, y) < f(x, y + 1)
-       def f(self, x, y):
+This is the custom function interface.
+You should not implement it, or speculate about its implementation
+class CustomFunction:
+    # Returns f(x, y) for any given positive integers x and y.
+    # Note that f(x, y) is increasing with respect to both x and y.
+    # i.e. f(x, y) < f(x + 1, y), f(x, y) < f(x, y + 1)
+    def f(self, x, y):
 
 """
 

solution/1200-1299/1237.Find Positive Integer Solution for a Given Equation/Solution2.py

@@ -1,11 +1,11 @@
 """
-   This is the custom function interface.
-   You should not implement it, or speculate about its implementation
-   class CustomFunction:
-       # Returns f(x, y) for any given positive integers x and y.
-       # Note that f(x, y) is increasing with respect to both x and y.
-       # i.e. f(x, y) < f(x + 1, y), f(x, y) < f(x, y + 1)
-       def f(self, x, y):
+This is the custom function interface.
+You should not implement it, or speculate about its implementation
+class CustomFunction:
+    # Returns f(x, y) for any given positive integers x and y.
+    # Note that f(x, y) is increasing with respect to both x and y.
+    # i.e. f(x, y) < f(x + 1, y), f(x, y) < f(x, y + 1)
+    def f(self, x, y):
 
 """
 

solution/3300-3399/3396.Minimum Number of Operations to Make Elements in Array Distinct/Solution.rs

@@ -1,13 +1,13 @@
-use std::collections::HashSet;
-
-impl Solution {
-    pub fn minimum_operations(nums: Vec<i32>) -> i32 {
-        let mut s = HashSet::new();
-        for i in (0..nums.len()).rev() {
-            if !s.insert(nums[i]) {
-                return (i / 3) as i32 + 1;
-            }
-        }
-        0
-    }
-}
+use std::collections::HashSet;
+
+impl Solution {
+    pub fn minimum_operations(nums: Vec<i32>) -> i32 {
+        let mut s = HashSet::new();
+        for i in (0..nums.len()).rev() {
+            if !s.insert(nums[i]) {
+                return (i / 3) as i32 + 1;
+            }
+        }
+        0
+    }
+}