add newline

Author: dahyeong-yun

coin-change/dahyeong-yun.java

@@ -28,4 +28,4 @@ public int coinChange(int[] coins, int amount) {
 
         return methods[amount] == amount + 1 ? -1 :  methods[amount];
     }
-}
+}

find-minimum-in-rotated-sorted-array/dahyeong-yun.java

@@ -29,4 +29,4 @@ public int findMin(int[] nums) {
         }
         return nums[left];
     }
-}
+}

maximum-depth-of-binary-tree/dahyeong-yun.java

@@ -14,4 +14,4 @@ public int maxDepth(TreeNode root) {
         if(root == null) return 0;
         return 1 + Math.max(maxDepth(root.left), maxDepth(root.right));
     }
-}
+}

word-search/dahyeong-yun.java

@@ -78,4 +78,4 @@ public boolean find(
 
         return false;
     }
-}
+}