###### leetcode Weekly Contest 67 -- 763. 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:

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

class Solution {
public:
vector<int> partitionLabels(string S)
{
int len = 0,m=0;
vector<int>sum;
map<char,int>mp;
int i=0;

while (i<S.length())
{
len++;
for (; i < len; i++)
{
if (!mp.count(S[i]))
{
mp[S[i]] = 0;
for (int j = S.length() - 1; j >= i; j--)
{
if (S[i] == S[j])
{
if (len <= j)
len = j + 1;
break;
}
}
}
}
sum.push_back(len - m);
m = len;
}
return sum;
}
};

#### LeetCode | 763. Partition Labels 中等偏难贪心算法 把一个字符串划分为有独立字母的最多组的划分方法

2018-01-18 17:55:04

#### 【LeetCode】763. Partition Labels 解题报告

2018-02-05 22:53:39

#### 算法5：leetcode 763. Partition Labels

2018-01-21 21:44:08

#### LWC 67: 763. Partition Labels

2018-01-14 15:38:50

#### [Leetcode] 763. Partition Labels 解题报告

2018-03-18 21:07:15

#### 763. Partition Labels

2018-01-14 20:56:27

#### LeetCode Partition Labels 问题

2018-01-16 13:47:51

#### Partition Labels

2018-01-27 18:06:54

#### Partition Labels-面试题

2018-03-10 14:15:14

#### leetcode763. 划分字母区间

2018-05-13 11:55:11

## 不良信息举报

leetcode Weekly Contest 67 -- 763. Partition Labels