-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathStringRepeat.java
66 lines (46 loc) · 1.8 KB
/
StringRepeat.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
63
64
65
66
import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.LinkedHashMap;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Scanner;
public class StringRepeat {
public static void main(String args[]) {
Scanner scanner = new Scanner(System.in);
System.out.println("Enter the string: ");
String input= scanner.next();
LinkedHashMap<Character, String> newStringHM = new LinkedHashMap<Character, String>();
for (char c : input.toCharArray())
{
newStringHM.put(Character.toLowerCase(c), newStringHM.containsKey(Character.toLowerCase(c)) ? newStringHM.get(Character.toLowerCase(c)).concat(Character.toString(c)) : Character.toString(c));
}
List<Map.Entry<Character, String>> entries = new ArrayList<Map.Entry<Character, String>>( newStringHM.entrySet() );
Collections.sort(entries, new Comparator<Map.Entry<Character, String>>(){
public int compare(Entry<Character, String> entry1, Entry<Character, String> entry2) {
return entry1.getValue().length() - entry2.getValue().length();
}
});
newStringHM.clear();
for(Map.Entry<Character, String> entry : entries){
newStringHM.put(entry.getKey(), entry.getValue());
}
String newString="";
boolean flag = true;
for (Entry<Character, String> entry : newStringHM.entrySet())
{
if(flag && entry.getValue().length()==1)
{
System.out.println("first letter that is not repeated :"+entry.getValue());
flag = false;
}
newString = newString.concat(entry.getValue());
}
if(flag)
{
System.out.println("no non-repeating letter found");
}
System.out.println("New String = "+newString);
}
}