leetcode 816. Ambiguous Coordinates

原创 2018年04月15日 21:58:28

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

816. Ambiguous Coordinates

We had some 2-dimensional coordinates, like &quot;(1, 3)&quot; or &quot;(2, 0.5)&quot;.  Then, we re...
  • zjucor
  • zjucor
  • 2018-04-15 15:55:13
  • 34

刷LeetCode刷LeetCode刷LeetCode刷LeetCode

  • 2018年01月09日 15:07
  • 1.55MB
  • 下载

spatial adjustment工具失败(The coordinates or measures are out of bounds)

将mdb中的featureclass 导出为shapefile
  • xiezhongkai08
  • xiezhongkai08
  • 2017-05-05 21:40:57
  • 374

XCode点击Commond无法定位到方法处,Reference to 'xxx' is ambiguous

symbol not found Reference to 'xxx' is ambiguous
  • u011421203
  • u011421203
  • 2015-05-12 10:47:11
  • 7948

关于Reference to 'xxxxx' is ambiguous 错误

最近引用工程的时候出现Reference to ‘xxxxx’ is ambiguous 错误 记录下 方便以后查询。 如图 检查pch文件和本文件是否包含了同一个库 ...
  • conglin1991
  • conglin1991
  • 2017-03-17 14:12:15
  • 6771

Homogeneous Coordinates(齐次坐标)

OpenGPU原帖 英文原帖 问题: 两条平行线会相交    铁轨在无限远处相交于一点 在欧几里得几何空间里,两条平行线永远都不会相交。但是在投影空间中,如右图中的两条铁轨在地平线处却是会相交...
  • fangchuawei
  • fangchuawei
  • 2015-01-18 23:21:35
  • 1361

Xcode报错Reference to '某个属性或对象' is ambiguous

一般造成这个问题的原因在于头文件引用的问题, 可以先Clean一下工程   找到对应的头文件引用 修改引用  然后   编译一般就可以通过了...
  • SYH523364
  • SYH523364
  • 2016-12-15 10:37:48
  • 4283

leetcode试题的答案

  • 2018年01月14日 18:29
  • 101KB
  • 下载

mean value coordinates

paper source:http://128.148.32.110/courses/cs224/papers/mean_value.pdf expanding proces...
  • seamanj
  • seamanj
  • 2016-03-18 06:45:51
  • 898

Maven: Maven Coordinates

Maven Coordinates
  • wwq518
  • wwq518
  • 2016-05-05 17:19:31
  • 185
收藏助手
不良信息举报
您举报文章:leetcode 816. Ambiguous Coordinates
举报原因:
原因补充:

(最多只允许输入30个字)