Java Algorithm

Author: par3k

BOJ_JAVA/src/SWEA/Solution_1949.java

@@ -37,7 +37,6 @@ private static void DFS(int x, int y, int h, int l, int cnt) {
         }
     }
 
-
     private static void Solution() {
         for (int i = 0; i < N; i++) {
             for (int j = 0 ;j  < N; j++) {
@@ -50,8 +49,6 @@ private static void Solution() {
         }
     }
 
-
-
     private static void input() throws IOException {
         BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
         StringBuilder sb = new StringBuilder();
@@ -65,7 +62,6 @@ private static void input() throws IOException {
             graph = new int[N][N];
             visited = new boolean[N][N];
 
-
             for (int i = 0 ; i < N; i++) {
                 StringTokenizer st = new StringTokenizer(br.readLine());
                 for (int j = 0; j < N; j++) {
@@ -80,7 +76,6 @@ private static void input() throws IOException {
         }
         System.out.println(sb.toString());
         br.close();
-
     }
 
     public static void main(String[] args) throws Exception {