833. Find And Replace in String

最新推荐文章于 2021-01-20 21:05:56 发布

linglingconglin

最新推荐文章于 2021-01-20 21:05:56 发布

阅读量182

点赞数

分类专栏：算法

本文链接：https://blog.csdn.net/u013260370/article/details/81256472

版权

算法专栏收录该内容

55 篇文章 0 订阅

订阅专栏

To some string S, we will perform some replacement operations that replace groups of letters with new ones (not necessarily the same size).

Each replacement operation has 3 parameters: a starting index i, a source word x and a target word y. The rule is that if x starts at position i in the original string S, then we will replace that occurrence of x with y. If not, we do nothing.

For example, if we have S = "abcd" and we have some replacement operation i = 2, x = "cd", y = "ffff", then because "cd" starts at position 2 in the original string S, we will replace it with "ffff".

Using another example on S = "abcd", if we have both the replacement operation i = 0, x = "ab", y = "eee", as well as another replacement operation i = 2, x = "ec", y = "ffff", this second operation does nothing because in the original string S[2] = 'c', which doesn't match x[0] = 'e'.

All these operations occur simultaneously. It's guaranteed that there won't be any overlap in replacement: for example, S = "abc", indexes = [0, 1], sources = ["ab","bc"] is not a valid test case.

Example 1:

Input: S = "abcd", indexes = [0,2], sources = ["a","cd"], targets = ["eee","ffff"]
Output: "eeebffff"
Explanation: "a" starts at index 0 in S, so it's replaced by "eee".
"cd" starts at index 2 in S, so it's replaced by "ffff".

Example 2:

Input: S = "abcd", indexes = [0,2], sources = ["ab","ec"], targets = ["eee","ffff"]
Output: "eeecd"
Explanation: "ab" starts at index 0 in S, so it's replaced by "eee". 
"ec" doesn't starts at index 2 in the original S, so we do nothing.

Notes:

0 <= indexes.length = sources.length = targets.length <= 100
0 < indexes[i] < S.length <= 1000
All characters in given inputs are lowercase letters.

方法1：利用map给index排序（map以红黑树实现，会自动将key进行排序）

class Solution {
public:
    string findReplaceString(string S, vector<int>& indexes, vector<string>& sources, vector<string>& targets) {
        map<int,vector<string>> st;
        int n=indexes.size();
        for(int i=0;i<n;i++){
            st[indexes[i]]={sources[i],targets[i]};
        }
        int addNum=0;
        for(auto tp:st){
            int m=tp.second[0].size();
            int t=tp.second[1].size();
            if(S.substr(tp.first+addNum,m)==tp.second[0]){
                S.replace(tp.first+addNum,m,tp.second[1]);
                addNum+=(t-m);
            }
        }
        return S;
    }
};

Tips：map用法，auto遍历 t.first t.second，迭代器遍历t->first t->second

vector<string> v={"aaa","bbb"},可如此初始化