MayUWell

Learn, Sleep, Learn

816-含糊的坐标

Description:

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.

问题描述

二维坐标,形如”(1, 3)”或者”(2, 0.5)”,我们将逗号,小数点,以及空白符移除后得到字符串S。

返回字符串列表,代表我们原本的二维坐标的所有可能性。

原来的表示形式不会有额外的0,所以不会以类似”00”, “0.0”, “0.00”开头或者所有本可以用更少数字表示的数。另外,小数点前至少有一个数,因此绝不会出现”.1”

答案可以由任意次序返回。注意,在逗号之后,坐标间有一个空格


问题分析

将字符串分为两端,分别处理

若S = “”,返回空
若S = “0”, 返回”0”
若形如”0xxx0”,则返回空
若形如”0xxx”,则返回”0.xxx”
若形如”xxx0”,则返回”xxx0”
返回”x.xxx,”xx.x”

最后将两边字符串得到的列表作笛卡尔集


解法

class Solution {
    public List<String> ambiguousCoordinates(String S) {
        int n = S.length();
        List<String> res = new ArrayList();
        for (int i = 1; i < n - 2; ++i) {
            List<String> A = f(S.substring(1, i + 1)), B = f(S.substring(i + 1, n - 1));
            for (String a : A) for (String b : B) res.add("(" + a + ", " + b + ")");
        }
        return res;
    }
    public List<String> f(String S) {
        int n = S.length();
        List<String> res = new ArrayList();

        if (n == 0 || (n > 1 && S.charAt(0) == '0' && S.charAt(n - 1) == '0')) return res;

        if (n > 1 && S.charAt(0) == '0') {
            res.add("0." + S.substring(1));
            return res;
        }

        res.add(S);

        if (n == 1 || S.charAt(n - 1) == '0') return res;

        for (int i = 1; i < n; ++i) res.add(S.substring(0, i) + '.' + S.substring(i));

        return res;
    }
}
阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/LaputaFallen/article/details/79951964
文章标签: 算法 数据结构
个人分类: 算法与数据结构
所属专栏: leetcode全解
上一篇817-链表连通组件
下一篇214-最短回文
想对作者说点什么? 我来说一句

坐标获取器

2017年09月05日 9KB 下载

javascript获得鼠标坐标.htm

2008年11月07日 3KB 下载

PC-E500逐桩坐标计算

2009年03月23日 3.99MB 下载

鼠标显示坐标鼠标显示坐标

2009年11月12日 162KB 下载

广东省边境坐标

2017年12月05日 17KB 下载

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

关闭
关闭