[SWEA] 1244 [S/W 문제해결 응용] 2일차 - 최대 상금 Java

https://swexpertacademy.com/main/code/problem/problemDetail.do?problemLevel=3&contestProbId=AV15Khn6AN0CFAYD&categoryId=AV15Khn6AN0CFAYD&categoryType=CODE&problemTitle=&orderBy=RECOMMEND_COUNT&selectCodeLang=ALL&select-1=3&pageSize=10&pageIndex=1

SW Expert Academy

 

[코드]

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;

public class CodingTest {
	static int[] number;
	static int max; // 최대값 저장
	static int trade;
	static String result;

	public static void main(String[] args) throws IOException {
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		for (int test_case = 1; test_case <= T; test_case++) {
			String num = sc.next();
			number = new int[num.length()];
			for (int i = 0; i < num.length(); i++) {
				number[i] = num.charAt(i) - '0';
			}
			trade = sc.nextInt(); // 교환 횟수

			if (trade > number.length)
				trade = number.length;

			dfs(0, 0); // dfs 시작

			System.out.println("#" + test_case + " " + max);
			max = 0;
		}
	}

	static void dfs(int start, int count) {
		int temp = 0;
		if (trade == count) {
			result = "";
			for (int n : number)
				result += String.valueOf(n); // 문자열로 붙여넣기
			max = Math.max(max, Integer.parseInt(result)); // 최대값
			return;
		}

		for (int i = start; i < number.length; i++) {
			for (int j = i + 1; j < number.length; j++) {
				temp = number[i];
				number[i] = number[j];
				number[j] = temp;
				dfs(i, count + 1); // 깊이 +1
				// 원래 자리로
				temp = number[i];
				number[i] = number[j];
				number[j] = temp;

			}
		}
	}

}