816. Ambiguous Coordinates

版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/zjucor/article/details/79949963

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.


类似于divide&conquer

class Solution:
    def ambiguousCoordinates(self, S):
        """
        :type S: str
        :rtype: List[str]
        """
        res = []
        S = S[1:-1]
        
        def single(i,j):
            if i==j: return [S[i]]
            if S[i:j+1]=='0'*(j+1-i): return []
            if S[i]=='0': 
                if S[j]!='0': return [S[i]+'.'+S[i+1:j+1]]
                else: return []
                
            l = [S[i:j+1]]
            if S[j]!='0':
                for p in range(i,j):
                    l.append(S[i:p+1]+'.'+S[p+1:j+1])
            return l
        
        for i in range(0,len(S)-1):
            l1 = single(0,i)
            l2 = single(i+1,len(S)-1)
            if not l1 or not l2: continue;
            for t1 in l1:
                for t2 in l2:
                    res.append('('+t1+', '+t2+')')
            
        return res
    
s=Solution()
print(s.ambiguousCoordinates("(123)"))    
print(s.ambiguousCoordinates("(00011)"))    
print(s.ambiguousCoordinates("(0123)"))    
print(s.ambiguousCoordinates("(100)"))  
print(s.ambiguousCoordinates("(0010)"))    


没有更多推荐了,返回首页

私密
私密原因:
请选择设置私密原因
  • 广告
  • 抄袭
  • 版权
  • 政治
  • 色情
  • 无意义
  • 其他
其他原因:
120
出错啦
系统繁忙,请稍后再试

关闭