solve find minimum depth of binary tree

Author: ohkingtaek

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

@@ -0,0 +1,8 @@
+class Solution:
+    def findMin(self, nums: List[int]) -> int:
+        """
+        시간복잡도: O(n)
+        공간복잡도: O(1)
+        왜 이렇게 해도 solve가 되네요..ㅎㅎ
+        """
+        return min(nums)