-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMain.java
More file actions
64 lines (48 loc) · 1.54 KB
/
Main.java
File metadata and controls
64 lines (48 loc) · 1.54 KB
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
64
import java.io.BufferedReader;
import java.io.IOException;
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());
int [] number = new int [N];
StringTokenizer st = new StringTokenizer(br.readLine());
int j=0;
while (st.hasMoreTokens()){
number[j]=Integer.parseInt(st.nextToken());
j++;
}
if(NextPerm(number, N)){
for (int i = 0; i < number.length; i++) {
System.out.print(number[i]+" ");
}
}else {
System.out.println(-1);
}
}
private static boolean NextPerm(int[] number, int n) {
int i = n-1;
//뒤에서 부터 오름차순이 끊긴 지점을 찾는다.
while (i>0 && number[i-1]>=number[i]) i--;
if(i==0){
return false;
}
int j=n-1;
// 끊긴 지점의 뒷 수보다 큰 수를 뒤에서 부터 찾는다.
while (number[i-1]>=number[j]) j--;
int tmp = number[i-1];
number[i-1]= number[j];
number[j]=tmp;
//끊긴지점 앞부분들의 수를 오름차순으로 정렬을 해준다.
j=n-1;
while (i<j){
tmp=number[i];
number[i]=number[j];
number[j]=tmp;
i+=1;
j-=1;
}
return true;
}
}