Merge pull request #1939 from CodingTestStudy2/최민지

[최민지] Day32

Author: github-actions[bot]

leetcode3/최민지/403.py

@@ -0,0 +1,18 @@
+class Solution:
+    def canCross(self, stones: List[int]) -> bool:
+
+        if stones[1] != 1:
+            return False
+            
+        dp = {stone: set() for stone in stones}
+        
+        dp[0].add(0)
+        
+        for stone in stones:
+            for k in dp[stone]:
+                for step in (k - 1, k, k + 1):
+                    if step > 0 and (stone + step) in dp:
+                        dp[stone + step].add(step)
+                        
+        return len(dp[stones[-1]]) > 0
+