dfs 부문을 이렇게 작성해도 되나요?

import java.util.*;
import java.io.*;

public class jelly {

    static int size;
    static int[][] map;
    static boolean[][] visited;
//    //size,size도달하면 HaruHaru, 아니면 hing

    public static void dfs(int y, int x){
        visited[y][x] = true;
        if(y == size && x == size) return;
        int n = map[y][x];
        if( (x + n) <= size && !visited[y][x+n])  dfs(y,x+n);
        if( (y + n) <= size && !visited[y+n][x])  dfs(y+n,x);
    }



    public static void main(String[] args)throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));

        size = Integer.parseInt(br.readLine());
        int Max = size +10;

        map = new int[Max][Max];
        visited = new boolean[Max][Max];

        for(int i = 1; i <= size; i ++){
            StringTokenizer st = new StringTokenizer(br.readLine());
            for(int j = 1; j <= size; j ++){
                map[i][j] = Integer.parseInt(st.nextToken());
            }
        }
        dfs(1,1);

        if(visited[size][size]){
            System.out.print("HaruHaru");
        }else  System.out.print("Hing");

        bw.close();
        br.close();
    }
}