René's URL Explorer Experiment

Title: Kjh 3주차 by hannahf97 · Pull Request #29 · JAVA-codingTest/algorithm-study · GitHub

Open Graph Title: Kjh 3주차 by hannahf97 · Pull Request #29 · JAVA-codingTest/algorithm-study

X Title: Kjh 3주차 by hannahf97 · Pull Request #29 · JAVA-codingTest/algorithm-study

Description: 양부터 다시 시작하겠습니다. import java.io.BufferedReader; import java.io.IOException; import java.util.StringTokenizer; public class Main{ static int R,C; static char[][] maps; static boolean[][] visited; static int dx[] = {1,0,-1,0}; static int dy[] = {0,1,0,-1}; static Queue queue = new LinkedList<>(); public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(br.readLine()); R = Integer.parseInt(st.nextToken()); C = Integer.parseInt(st.nextToken()); visited =new boolean[R][C]; maps = new char[R][C]; int vcount = 0; int ocount =0; for(int i=0; i=0 && nX < R && nY >=0 && nY < C){ if(maps[nX][nY] == 'V' && !visited[nX][nY]){ queue.add(new int[]{nX,nY}); vistied[nX][nY] = true; vcount +=1; } else if(maps[nX][nY] == '#'){ continue; } else if(maps[nX][nY] == '.' && !visited[nX][nY]){ queue.add(new int[]{nX,nY}); visited[nX][nY] = true; } else if(maps[nX][nY] == 'O'){ ocount += 1; } } } } } }

Open Graph Description: 양부터 다시 시작하겠습니다. import java.io.BufferedReader; import java.io.IOException; import java.util.StringTokenizer; public class Main{ static int R,C; static char[][] maps; static boolean[][]...

X Description: 양부터 다시 시작하겠습니다. import java.io.BufferedReader; import java.io.IOException; import java.util.StringTokenizer; public class Main{ static int R,C; static char[][] maps; static boolean[][]...

Opengraph URL: https://github.com/JAVA-codingTest/algorithm-study/pull/29

X: @github

direct link

Domain: patch-diff.githubusercontent.com

Links:

Viewport: width=device-width