Updated markdown files

Author: Zanger67/leetcode

markdowns/_1415. The k-th Lexicographical String of All Happy Strings of Length n.md

@@ -44,9 +44,9 @@ class Solution:
                 lambda rem, n, output: 
                     ''.join(output) if not n else 
                     _pm_dfs(
-                        rem - (pot_per_path if (temp := int(rem > (pot_per_path := 2 ** (n - 1)))) else 0), 
+                        rem - (pot_per_path if (indx := int(rem > (pot_per_path := 2 ** (n - 1)))) else 0), 
                         n - 1, 
-                        output + ['abc'.replace(output[-1], '')[temp]]
+                        output + ['abc'.replace(output[-1], '')[indx]]
                     )
             )
         )(
@@ -61,7 +61,7 @@ class Solution:
 ```Python
 class Solution:
     def getHappyString(self, n: int, k: int) -> str:
-        return (_pm_dfs := (lambda rem, n, output: ''.join(output) if not n else _pm_dfs(rem - (pot_per_path if (temp := int(rem > (pot_per_path := 2 ** (n - 1)))) else 0), n - 1, output + ['abc'.replace(output[-1], '')[temp]])))(k - x * pot_n_min_1,n, [chr(ord('a') + x)]) if (x := (k - 1) // (pot_n_min_1 := 2 ** (n := n - 1))) <= 2 else ''
+        return (_pm_dfs := (lambda rem, n, output: ''.join(output) if not n else _pm_dfs(rem - (pot_per_path if (indx := int(rem > (pot_per_path := 2 ** (n - 1)))) else 0), n - 1, output + ['abc'.replace(output[-1], '')[indx]])))(k - x * pot_n_min_1,n, [chr(ord('a') + x)]) if (x := (k - 1) // (pot_n_min_1 := 2 ** (n := n - 1))) <= 2 else ''
 ```
 
 #### [m1415.py](<../my-submissions/m1415.py>)