이전 순열 (10973번)
https://www.acmicpc.net/problem/10973
풀이방법
다음 순열 (10973) 과 비슷한 문제로, 반복문의 부등호 방향만 바꿔주면 된다.
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int N = Integer.parseInt(br.readLine());
StringTokenizer st = new StringTokenizer(br.readLine());
int[] arr = new int[N];
int index = 0;
while (st.hasMoreTokens()) {
arr[index++] = Integer.parseInt(st.nextToken());
}
StringBuilder sb = new StringBuilder();
if (nextPermutation(arr)) {
for(int i : arr) {
sb.append(i).append(' ');
}
System.out.println(sb);
}
else {
System.out.println(-1);
}
}
private static boolean nextPermutation(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 (arr[i-1] < arr[j]) {
j--;
}
swap(arr, i-1, j);
reverse(arr, i);
return true;
}
private static void swap(int[] arr, int idx1, int idx2) {
int tmp = arr[idx1];
arr[idx1] = arr[idx2];
arr[idx2] = tmp;
}
private static void reverse(int[] arr, int startIndex) {
int endIndex = arr.length-1;
while (startIndex <= endIndex) {
swap(arr, startIndex++, endIndex--);
}
}
}
Comments powered by Disqus.