[SWEA][D2] 1979. 어디에 단어가 들어갈 수 있을까 Java

import java.util.Arrays;  
import java.util.Scanner;  
  
public class wordPuzzle {  
  
    public static void main(String[] args) {  
  
        Scanner sc = new Scanner(System.in);  
        int T;  
        T=sc.nextInt();  
        sc.nextLine();  
  
  
        for(int test_case = 1; test_case <= T; test_case++)  
        {  
            int N = sc.nextInt();  
            int wordLength = sc.nextInt();  
  
            int[][] puzzle = new int[N][N];  
            int answer = 0;  
  
            // 퍼즐 구현  
            for (int i = 0; i < N; i++) {  
                for (int j = 0; j < N; j++) {  
                    puzzle[i][j] = sc.nextInt();  
                }  
            }  
            // 가로 측정  
            for (int i = 0; i < N; i++) {  
                int count = 0;  
                for (int j = 0; j < N; j++) {  
                    // 1일때  
                    if(puzzle[i][j] == 1){  
                        count++;  
                    }else{ // 0일때  
                        if(count == wordLength){  
                            answer++;  
                        }  
                        count = 0;  
                    }  
                }  
                if (count == wordLength) answer++;  
            }  
  
            // 세로측정  
            for (int i = 0; i < N; i++) {  
                int count = 0;  
                for (int j = 0; j < N; j++) {  
                    // 1일때  
                    if(puzzle[j][i] == 1){  
                        count++;  
                    }else{ // 0일때  
                        if(count == wordLength){  
                            answer++;  
                        }  
                        count = 0;  
                    }  
                }  
                if (count == wordLength) answer++;  
            }  
            System.out.println("#" + test_case + " " + answer);  
//            System.out.print(Arrays.deepToString(puzzle));  
        }  
    }  
}