BackJoon Algorithm - Java
문제
풀이
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.lang.reflect.Array;
import java.util.ArrayList;
import java.util.Collections;
public class Back_2668 {
static ArrayList<Integer> list;
static boolean[] visited;
static int[] num;
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int N = Integer.parseInt(br.readLine());
num = new int[N + 1];
for (int i = 1; i <= N; i++) {
num[i] = Integer.parseInt(br.readLine());
}
list = new ArrayList<>();
visited = new boolean[N + 1];
for (int i = 1; i <= N; i++) {
visited[i] = true;
dfs(i, i);
visited[i] = false;
}
Collections.sort(list);
System.out.println(list.size());
for (int i = 0; i < list.size(); i++) {
System.out.println(list.get(i));
}
br.close();
}
static void dfs(int start, int target) {
if (visited[num[start]] == false) {
visited[num[start]] = true;
dfs(num[start], target);
visited[num[start]] = false;
}
if (num[start] == target) list.add(target);
}
}
댓글남기기