feat: add solutions to lc problem: No.1102

No.1102.Path With Maximum Minimum Value

Author: yanglbme

solution/1000-1099/1096.Brace Expansion II/Solution.py

@@ -6,8 +6,8 @@ def dfs(exp):
                 s.add(exp)
                 return
             i = exp.rfind('{', 0, j - 1)
-            a, c = exp[:i], exp[j + 1:]
-            for b in exp[i + 1: j].split(','):
+            a, c = exp[:i], exp[j + 1 :]
+            for b in exp[i + 1 : j].split(','):
                 dfs(a + b + c)
 
         s = set()