Add Solution.py for 0887.Super Egg Drop

Author: Hinsteny

solution/0887.Super Egg Drop/Solution.py

@@ -0,0 +1,8 @@
+class Solution:
+    def superEggDrop(self, K: int, N: int) -> int:
+        dp = [1] * (K)
+        while dp[K - 1] < N:
+            for i in range(K - 1, 0, -1):
+                dp[i] = dp[i] + dp[i - 1] + 1
+            dp[0] = dp[0] + 1
+        return dp[0]

solution/README.md

@@ -943,7 +943,8 @@
 │   └── Solution.py
 ├── 0887.Super Egg Drop
 │   ├── README.md
-│   └── Solution.java
+│   ├── Solution.java
+│   └── Solution.py
 ├── 0889.Construct Binary Tree from Preorder and Postorder Traversal
 │   ├── README.md
 │   └── Solution.py