줄바꿈 추가

Author: devyejin

find-minimum-in-rotated-sorted-array/devyejin.py

@@ -1,3 +1,3 @@
 class Solution:
     def findMin(self, nums: List[int]) -> int:
-        return min(nums)
+        return min(nums)

word-search/devyejin.py

@@ -28,3 +28,4 @@ def backtrack(x, y, idx):
                     return True
 
         return False
+