-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathremove duplicate
87 lines (56 loc) · 1.54 KB
/
remove duplicate
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
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
//Enter code here
import java.util.*;
import java.io.*;
class Main{
static class FastReader
{
BufferedReader br;
StringTokenizer st;
public FastReader()
{
br = new BufferedReader(new InputStreamReader(System.in));
}
String next()
{
while (st == null || !st.hasMoreElements()){
try { st = new StringTokenizer(br.readLine()); }
catch (IOException e) { e.printStackTrace(); }
}
return st.nextToken();
}
int nextInt() { return Integer.parseInt(next()); }
long nextLong() { return Long.parseLong(next()); }
double nextDouble(){ return Double.parseDouble(next()); }
String nextLine(){
String str = "";
try { str = br.readLine(); }
catch (IOException e) { e.printStackTrace(); }
return str;
}
}
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
String n = sc.nextLine();
// int k = sc.nextInt();
// int[] a = new int[n];
// for(int i=0;i<n;i++){
// a[i] = sc.nextInt();
// }
call(n);
}
public static void call(String s){
Map<Character,Integer> mp =new LinkedHashMap<>();
for(int i=0;i<s.length();i++){
if(mp.containsKey(s.charAt(i))){
// mp.put(s.charAt(i),mp.get(s.charAt(i)+1))
}else{
mp.put(s.charAt(i),1);
}
}
for (Character name : mp.keySet()) {
System.out.print(name);
}
}
}
// 6 3
// 1 2 3 4 5 6