leetcode 816. Ambiguous Coordinates

leetcode 816. Ambiguous Coordinates

---

原题地址：https://leetcode.com/problems/ambiguous-coordinates/

题目

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.

python代码

class Solution:
    def ambiguousCoordinates(self, S):
        """
        :type S: str
        :rtype: List[str]
        """
        def pos(li):
                if len(li) == 1:
                    return True
                else:
                    return True if li[0]!="0" else False
        def point(li):
            if li.count("0") == len(li):
                return False
            if li[-1] == "0":
                return False
            return True
        out = []
        S = S[1:-1]
        li = list(S)

        for i in range(1, len(li)):
            left = li[:i]
            right = li[i:]

            for j in range(len(left)):
                if j == len(left)-1:
                    if pos(left[:j+1]):
                        le = "".join(left[:j+1])


                        for k in range(len(right)):
                            if k == len(right)-1:
                                if pos(right[:k+1]):
                                    ri = "".join(right[:k+1])
                                    out.append("(" + le + ', ' + ri +')')
                            else:
                                if pos(right[:k+1]) and point(right[k+1:]):
                                    ri = "".join(right[:k+1])+'.'+"".join(right[k+1:])
                                    out.append("(" + le + ', ' + ri +')')




                else:
                    if pos(left[:j+1]) and point(left[j+1:]):
                        le = "".join(left[:j+1])+'.'+"".join(left[j+1:])


                        for k in range(len(right)):
                            if k == len(right)-1:
                                if pos(right[:k+1]):
                                    ri = "".join(right[:k+1])
                                    out.append("(" + le + ', ' + ri +')')
                            else:
                                if pos(right[:k+1]) and point(right[k+1:]):
                                    ri = "".join(right[:k+1])+'.'+"".join(right[k+1:])
                                    out.append("(" + le + ', ' + ri +')')
        return out

来比较一下大佬们的代码

def ambiguousCoordinates(self, S):
        S = S[1:-1]
        def f(S):
            if not S or len(S) > 1 and S[0] == S[-1] == '0': return []
            if S[-1] == '0': return [S]
            if S[0] == '0': return [S[0] + '.' + S[1:]]
            return [S] + [S[:i] + '.' + S[i:] for i in range(1, len(S))]
        return ['(%s, %s)' % (a, b) for i in range(len(S)) for a, b in itertools.product(f(S[:i]), f(S[i:]))]

版权声明：转载注明 http://blog.csdn.net/birdreamer/article/details/79953972