Algorithm


Problem Name: 816. 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.

  • For example, "(1, 3)" becomes s = "(13)" and "(2, 0.5)" becomes s = "(205)".

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 fewer digits. Also, a decimal point within a number never occurs without at least one digit occurring before it, so we never started with numbers like ".1".

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

 

Example 1:

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

Example 2:

Input: s = "(0123)"
Output: ["(0, 1.23)","(0, 12.3)","(0, 123)","(0.1, 2.3)","(0.1, 23)","(0.12, 3)"]
Explanation: 0.0, 00, 0001 or 00.01 are not allowed.

Example 3:

Input: s = "(00011)"
Output: ["(0, 0.011)","(0.001, 1)"]

 

Constraints:

  • 4 <= s.length <= 12
  • s[0] == '(' and s[s.length - 1] == ')'.
  • The rest of s are digits.

Code Examples

#1 Code Example with Python Programming

Code - Python Programming


class Solution:
    def ambiguousCoordinates(self, S):
        def properInt(s):
            return len(s) > 1 and s[0] != "0" or len(s) == 1
        
        def properFloat(s, i):
            return s[-1] not in ".0" and properInt(s[:i])
        
        s, res = S[1:-1], set()
        for i in range(len(s)):
            n1, n2 = s[:i + 1], s[i + 1:]
            p1, p2 = properInt(n1), properInt(n2)
            if p1 and p2:
                res.add("({}, {})".format(n1, n2))
            for j in range(len(n1)):
                for k in range(len(n2)):
                    n1f = n1[:j + 1] + "." + n1[j + 1:]
                    n2f = n2[:k + 1] + "." + n2[k + 1:]
                    p1f = properFloat(n1f, j + 1)
                    p2f = properFloat(n2f, k + 1)
                    if p1f and p2f:
                        res.add("({}, {})".format(n1f, n2f))
                    if p1f and p2:
                        res.add("({}, {})".format(n1f, n2))
                    if p1 and p2f:
                        res.add("({}, {})".format(n1, n2f))
        return list(res)
Copy The Code & Try With Live Editor

Input

x
+
cmd
s = "(123)"

Output

x
+
cmd
["(1, 2.3)","(1, 23)","(1.2, 3)","(12, 3)"]
Advertisements

Demonstration


Previous
#815 Leetcode Bus Routes Solution in C, C++, Java, JavaScript, Python, C# Leetcode
Next
#817 Leetcode Linked List Components Solution in C, C++, Java, JavaScript, Python, C# Leetcode