Skip to content

Latest commit

 

History

History
 
 

ambiguous-coordinates

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
 
 

Leetcode: Ambiguous Coordinates


Ambiguous Coordinates


Similar Problems:


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.

Github: code.dennyzhang.com

Credits To: leetcode.com

Leave me comments, if you have better ways to solve.


## https://code.dennyzhang.com/ambiguous-coordinates
## Basic Ideas: Divide S into two parts; Then add comma
##   The tricky part is adding comma
##   How we can verify the combination?
##
##  if S == "": return []
##  if S == "0": return [S]
##  if S == "0XXX0": return []
##  if S == "0XXX": return ["0.XXX"]
##  if S == "XXX0": return [S]
##  return [S, "X.XXX", "XX.XX", "XXX.X"...]
##
## Complexity: Time O(n^2), Space O(n^2)
class Solution:
    def ambiguousCoordinates(self, S):
        """
        :type S: str
        :rtype: List[str]
        """
        def addComma(myStr):
            if len(myStr) == 0: return []
            if len(myStr) == 1: return [myStr]
            # check myStr[0] and myStr[-1]
            res = []
            if myStr[-1] == "0":
                # 0AB0
                res = []
            elif myStr[0] == "0":
                # 0AB
                res = ["%s.%s" % (myStr[0], myStr[1:])]
            else:
                # AB
                for i in range(len(myStr)-1):
                    res.append("%s.%s" % (myStr[0:i+1], myStr[i+1:]))

            if myStr[0] != "0": res.append(myStr)
            return res

        res = []
        S = S[1:-1]
        for i in range(len(S)-1):
            list1, list2 = addComma(S[0:i+1]), addComma(S[i+1:])
            for p1 in list1:
                for p2 in list2:
                    res.append("(%s, %s)" % (p1, p2))
        return res
linkedin
github
slack