LeetCode 816 Ambiguous Coordinates (DFS)

We had some 2-dimensional coordinates, like "(1, 3)" or "(2, 0.5)".  Then, we removed all commas, decimal points, and spaces, and ended up with the string S.  Return a list of strings representing all possibilities for what our original coordinates could have been.

Our original representation never had extraneous zeroes, so we never started with numbers like "00", "0.0", "0.00", "1.0", "001", "00.01", or any other number that can be represented with less digits.  Also, a decimal point within a number never occurs without at least one digit occuring before it, so we never started with numbers like ".1".

The final answer list can be returned in any order.  Also note that all coordinates in the final answer have exactly one space between them (occurring after the comma.)

Example 1:
Input: "(123)"
Output: ["(1, 23)", "(12, 3)", "(1.2, 3)", "(1, 2.3)"]

Example 2:
Input: "(00011)"
Output:  ["(0.001, 1)", "(0, 0.011)"]
Explanation: 
0.0, 00, 0001 or 00.01 are not allowed.

Example 3:
Input: "(0123)"
Output: ["(0, 123)", "(0, 12.3)", "(0, 1.23)", "(0.1, 23)", "(0.1, 2.3)", "(0.12, 3)"]

Example 4:
Input: "(100)"
Output: [(10, 0)]
Explanation: 
1.0 is not allowed.

Note:

• 4 <= S.length <= 12.
• S[0] = "(", S[S.length - 1] = ")", and the other elements in S are digits.

题目链接：https://leetcode.com/problems/ambiguous-coordinates/

题目分析：DFS，应该还能剪

class Solution {
    
    boolean judge(String s) {
        if (s.indexOf('.') != -1 && s.charAt(s.length() - 1) == '0') {
            return false;
        }
        return true;
    }
    
    boolean midJudge(String s) {
        int p = s.indexOf('.');
        if (p == 0) {
            return false;
        }
        if (p == -1 && s.length() > 1 && s.charAt(0) == '0') {
            return false;
        }
        if (p != -1 && s.charAt(0) == '0' && s.charAt(1) != '.') {
            return false;
        }
        return true;
    }
    
    public void DFSB(boolean ok, int idx, String a, String b, String S, Set<String> ans) {
        if (!midJudge(b)) {
            return;
        }
        if (idx == S.length()) {
            if (judge(b)) {
                ans.add("(" + a + ", " + b + ")");
            }
            return;
        } 
        
        if (ok) {
            DFSB(false, idx, a, b + ".", S, ans);
        }
        DFSB(ok, idx + 1, a, b + S.charAt(idx), S, ans);
    }
    
    public void DFSA(boolean ok, int idx, String a, String S, Set<String> ans) {
        if (!midJudge(a) || idx == S.length()) {
            return;
        }
        if (ok) {
            DFSA(false, idx, a + ".", S, ans);
        }
        String nxt = a + S.charAt(idx);
        DFSA(ok, idx + 1, nxt, S, ans);
        if (idx + 1 < S.length() && judge(nxt) && midJudge(nxt)) {
            DFSB(true, idx + 1, nxt, "", S, ans);
        }
    }
    
    public List<String> ambiguousCoordinates(String S) {
        Set<String> ans = new HashSet<>();
        DFSA(true, 0, "", S.substring(1, S.length() - 1), ans);
        return new ArrayList<String>(ans);
    }
}