BEAKJOON JAVA ALGORITHM #10971(외판원 순회2)

https://www.acmicpc.net/problem/10971

import java.util.Scanner; public class a10971 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int num = sc.nextInt(); int[][] money = new int[num][num]; int[] arr = new int[num]; for(int i=0; i<num; i++) { arr[i] = i; for(int j=0; j<num; j++) { money[i][j] = sc.nextInt(); } } int temp = Integer.MAX_VALUE; while(nextArr(arr)) { int sum = 0; boolean check = true; for(int i=0; i<num-1; i++) { if(money[arr[i]][arr[i+1]] == 0) {//통행료 0인지아닌지 check = false; }else { sum += money[arr[i]][arr[i+1]]; } } if(check && money[arr[num-1]][arr[0]] != 0) {//마지막에서 돌아가는거 더해주기 sum += money[arr[num-1]][arr[0]]; if(temp > sum) { temp = sum; } } } System.out.println(temp); } public static boolean nextArr(int[] arr) { int i = arr.length-1; while(i>0 && arr[i-1] >= arr[i]) { i--; } if(i <= 0) { return false; } int j = arr.length-1; while(j >= i && arr[j] <= arr[i-1]) { j--; } int temp = arr[i-1]; arr[i-1] = arr[j]; arr[j] = temp; j = arr.length-1; while(i < j) { temp = arr[i]; arr[i] = arr[j]; arr[j] = temp; i++; j--; } return true; } }