-
Notifications
You must be signed in to change notification settings - Fork 0
/
Main.java
62 lines (54 loc) · 1.65 KB
/
Main.java
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
package numbergame;
import java.util.ArrayList;
import java.util.Scanner;
import java.util.TreeSet;
/**
* 牛牛举办了一场数字游戏,有n个玩家参加这个游戏,游戏开始每个玩家选定一个数, 然后将这个数写在纸上(十进制数,无前缀零),然后接下来对于每一个数字将其数位
* 按照非递减顺序排列,得到新的数,新数的前缀零将被忽略。得到最大数字的玩家赢 得这个游戏。
*
* @author MA
*
*/
public class Main {
public static int maxNum(String num, int count) {
TreeSet<Integer> set = new TreeSet<>();
String[] numarr = num.split(" ");
int value = 0;
for (int i = 0; i < numarr.length; i++) {
value = refatornum(numarr[i]);
//System.out.println(numarr[i]);
set.add(value);
}
return set.last();
}
public static int refatornum(String number) {
StringBuffer sb = new StringBuffer();
int numInt = Integer.parseInt(number);
TreeSet<Integer> set = new TreeSet<>();
while(numInt != 0 ){
int i = numInt % 10;
set.add(i);
numInt = numInt / 10;
}
int beishu = 1;
ArrayList<Integer> list = new ArrayList<>();
for(int i = set.size() ; i>0 ; i--){
list.add(set.last() * beishu);
int d = set.pollLast();
beishu = beishu * 10;
}
int sum = 0;
for(int i : list){
sum = i + sum;
}
return sum;
}
public static void main(String[] args) {
Scanner sc1 = new Scanner(System.in);
String num = sc1.nextLine();
Scanner sc2 = new Scanner(System.in);
int count = sc2.nextInt();
int result = maxNum(num, count);
System.out.println(result);
}
}