sol 4-weeks

Author: acious

find-minimum-in-rotated-sorted-array/acious.kt

@@ -24,4 +24,4 @@ class Solution {
         // 반복문이 끝날 때까지 못 찾았거나, 배열이 회전되지 않은 경우 첫 번째 요소가 최소값
         return nums[0]
     }
-}
+}

maximum-depth-of-binary-tree/acious.kt

@@ -34,4 +34,4 @@ class Solution {
 
         return maxDepth
     }
-}
+}

merge-two-sorted-lists/acious.kt

@@ -28,4 +28,4 @@ class Solution {
 
         return resultStartNode.next
     }
-}
+}