LeetCode 763. Partition Labels

最新推荐文章于 2020-10-22 23:24:12 发布

ZayneHuang

最新推荐文章于 2020-10-22 23:24:12 发布

阅读量156

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/github_36324732/article/details/81218176

版权

LeetCode 专栏收录该内容

20 篇文章 0 订阅

订阅专栏

题目链接：https://leetcode.com/problems/partition-labels/description/

A string S of lowercase letters is given. We want to partition this string into as many parts as possible so that each letter appears in at most one part, and return a list of integers representing the size of these parts.

Example 1:
Input: S = "ababcbacadefegdehijhklij"
Output: [9,7,8]
Explanation:
The partition is "ababcbaca", "defegde", "hijhklij".
This is a partition so that each letter appears in at most one part.
A partition like "ababcbacadefegde", "hijhklij" is incorrect, because it splits S into less parts.
Note:

S will have length in range [1, 500].
S will consist of lowercase letters ('a' to 'z') only.

题目解析：将字符串里面每个字符的最后位置预处理出来，然后扫一遍字符串，不断向前更新最远位置即可，保证每一段里面的字符都不在之后出现。这样是 O(n) 复杂度。

代码如下：0ms Accepted beating 100%

class Solution {
public:
    vector<int> partitionLabels(string S) {
        vector<int> ans;
        int lastPos[26];
        memset(lastPos, -1, sizeof (lastPos));
        int len = S.size();
        for (int i = len - 1; i >= 0; i--)
            if (lastPos[S[i] - 'a'] == -1)
                lastPos[S[i] - 'a'] = i;
        for (int i = 0 ; i < len; )
        {
            int lastpos = lastPos[S[i] - 'a'];
            for (int j = i; j < lastpos; j++)
                if (lastPos[S[j] - 'a'] > lastpos)
                    lastpos = lastPos[S[j] - 'a'];
            ans.push_back(lastpos - i + 1);
            i = lastpos + 1;
        }
        return ans;
    }
};

static auto _____ = []() {
    std::ios::sync_with_stdio(false);
    cin.tie(NULL);
    return 0;
}();