leetcode763+贪心。map记录每个字符最右边的位置

https://leetcode.com/problems/partition-labels/ class Solution { public: vector<int> partitionLabels(string S) { map<char, int> d; for(int i=0; i<S.size(); i++){ d[S[i]

>>阅读原文<<