Updated markdown files

Author: Zanger67/leetcode

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

@@ -31,40 +31,11 @@
 
 ## Solutions
 
+- [m1415 v1.py](<../my-submissions/m1415 v1.py>)
 - [m1415 v2 cursed oneliner expanded.py](<../my-submissions/m1415 v2 cursed oneliner expanded.py>)
 - [m1415 v2 oneliner.py](<../my-submissions/m1415 v2 oneliner.py>)
-- [m1415.py](<../my-submissions/m1415.py>)
 ### Python
-#### [m1415 v2 cursed oneliner expanded.py](<../my-submissions/m1415 v2 cursed oneliner expanded.py>)
-```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 (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 v2 oneliner.py](<../my-submissions/m1415 v2 oneliner.py>)
-```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 (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>)
+#### [m1415 v1.py](<../my-submissions/m1415 v1.py>)
 ```Python
 class Solution:
     # _pm_dfs stands for premature dfs
@@ -97,3 +68,32 @@ class Solution:
 
 ```
 
+#### [m1415 v2 cursed oneliner expanded.py](<../my-submissions/m1415 v2 cursed oneliner expanded.py>)
+```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 (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 v2 oneliner.py](<../my-submissions/m1415 v2 oneliner.py>)
+```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 (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 ''
+```
+