题目地址：https://leetcode.com/problems/ambiguous-coordinates/description/
题目描述：
Wehad 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.
Ouroriginal 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".
Thefinal 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:
1、 4<=S.length<=12.；
2、 S[0]="(",S[S.length-1]=")",andtheotherelementsinSaredigits.；
题目大意
输入是一个用括号包起来的数字组成的字符串，要对这个数字字符串进行分割，分成两个合理数字。合理数字的定义是整数或者小数。并且整数不能有前导0，小数不能有末尾0.
解题方法
这个应该是属于python玩字符串里面比较难的题了。
首先分成两部分还好办，直接用字符串切片即可。其次，难点在于判断分成合理的整数和小数。
1、 看能否组成合理整数：长度为1或者没有前导0；
2、 看能否组成合理小数：把数字再次分割成整数部分和小数部分；
- 整数部分可以只有1位并且为0，否则不能有前导0
- 小数部分结尾不能为0
最后的结果是分成的左右部分能够成的所有整数或者小数的组合。
class Solution(object):
def ambiguousCoordinates(self, S):
"""
:type S: str
:rtype: List[str]
"""
ans = []
S = S[1:-1]
for i in range(1, len(S)):
left, right = S[:i], S[i:]
left_list = self.get_number(left)
right_list = self.get_number(right)
if left_list and right_list:
for left_number in left_list:
for right_number in right_list:
ans.append("(" + left_number + ", " + right_number + ")")
return ans
def get_number(self, num):
decimal_list = []
if len(num) == 1 or num[0] != '0':
decimal_list.append(num)
for i in range(1, len(num)):
integer, fractor = num[:i], num[i:]
print(integer, fractor)
if (len(integer) > 1 and integer[0] == '0') or fractor[-1] == '0':
continue
decimal_list.append(integer + '.' + fractor)
return decimal_list
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29
DDKK.COM 弟弟快看-教程，程序员编程资料站，版权归原作者所有
本文经作者：负雪明烛 授权发布，任何组织或个人未经作者授权不得转发