-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathQuestion2.java
51 lines (42 loc) · 1.76 KB
/
Question2.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
package singh;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashSet;
public class Question2 {
static boolean isDigit(char digit) {
if (digit >= '0' && digit <= '9')
return true;
return false;
}
public static void main(String[] args) throws Exception {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String input = br.readLine();
StringBuilder sb = new StringBuilder();
HashSet < Integer > hs = new HashSet < > ();
for (int i = 0; i < input.length(); i++) {
if (isDigit(input.charAt(i))) {
String dig = String.valueOf(input.charAt(i));
hs.add(Integer.parseInt(dig));
}
}
ArrayList < Integer > digitList = new ArrayList < > (hs);
Collections.sort(digitList, Collections.reverseOrder());
int len = digitList.size();
boolean evenDigitFound = false;
for (int i = len - 1; i >= 0; i--) {
int digit = digitList.get(i);
if (digit % 2 == 0) {
digitList.remove(i);
digitList.add(digit); //adding even digit at end
evenDigitFound = true;
break;
}
}
if (evenDigitFound == false) {
System.out.print(-1);
} else {
for (int dig: digitList) System.out.print(dig); // printing largest even digits
}
}}