-
Notifications
You must be signed in to change notification settings - Fork 4
/
Copy pathAmbiguous Coordinates.java
41 lines (39 loc) · 1.44 KB
/
Ambiguous Coordinates.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
class Solution {
public List<String> ambiguousCoordinates(String s) {
String string = s.substring(1, s.length() - 1);
ArrayList<String> result = new ArrayList<String>();
for (int i=1; i<string.length(); i++) {
List<String> first = findValidCombinations(string.substring(0, i));
List<String> second = findValidCombinations(string.substring(i));
for (String firstString : first) {
for (String secondString : second) {
result.add("(" + firstString + ", " + secondString + ")");
}
}
}
return result;
}
private List<String> findValidCombinations(String string) {
char[] charArray = string.toCharArray();
ArrayList<String> result = new ArrayList<String>();
if (charArray[0] == '0' && charArray[string.length() - 1] == '0') {
if (string.length() == 1) {
result.add("0");
}
return result;
}
if (charArray[0] == '0') {
result.add("0." + string.substring(1));
return result;
}
if (charArray[string.length() - 1] == '0') {
result.add(string);
return result;
}
result.add(string);
for (int i=1; i<string.length(); i++) {
result.add(string.substring(0, i) + '.' + string.substring(i));
}
return result;
}
}