【枚举】先划分成逗号前后的两部分,看两部分能构成多少种合法的整数和小数。其中整数不能是两个以上的0,而且不能有前导0;小数不能有后面的0,并且不能只是一个0。
class Solution {
// 9:54
List<String> check(String str) {
List<String> ret = new ArrayList();
int n = str.length();
if (str.charAt(0) == '0') {
if (n == 1) ret.add(str);
else {
if (str.charAt(n - 1) == '0');
else ret.add(str.substring(0, 1) + "." + str.substring(1, n));
}
} else {
ret.add(str);
if (str.charAt(n - 1) == '0');
else {
for (int i = 1; i < n; i++) {
ret.add(str.substring(0, i) + "." + str.substring(i, n));
}
}
}
return ret;
}
public List<String> ambiguousCoordinates(String s) {
List<String> ans = new ArrayList();
int n = s.length();
for (int i = 2; i < n - 1; i++) {
List<String> left = check(s.substring(1, i));
// System.out.println(s.substring(1, i));
List<String> right = check(s.substring(i, n - 1));
for (String l: left) {
for (String r: right) {
ans.add("(" + l + ", " + r + ")");
}
}
}
return ans;
}
}
class Solution {
public:
// 10:29
vector<string> check(string str) {
vector<string> ret;
int n = str.length();
if (str[0] == '0') {
if (n == 1) ret.push_back(str);
else {
if (str[n - 1] == '0');
else {
ret.push_back(str.substr(0, 1) + "." + str.substr(1, n - 1));
}
}
} else {
ret.push_back(str);
if (str[n - 1] == '0');
else {
for (int i = 1; i < n; i++) {
ret.push_back(str.substr(0, i) + "." + str.substr(i, n - i));
}
}
}
return ret;
}
vector<string> ambiguousCoordinates(string s) {
vector<string> ans;
int n = s.length();
for (int i = 2; i < n - 1; i++) {
vector<string> left = check(s.substr(1, i - 1));
vector<string> right = check(s.substr(i, n - 1 - i));
for (string l: left) {
for (string r: right) {
ans.push_back("(" + l + ", " + r + ")");
}
}
}
return ans;
}
};