833.Find And Replace in String

题目描述:

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:

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

英文虽然很多,不过主要看例子就可以大概了解本题的意思了,首先给出4个参数,

第一个参数是字符串,第二个是整数数组,第三和第四个是字符串数组,按要求让

整数数组中的每一个数字以字符串的下标相对应然后取出相应字符,例如数组[0, 2],

字符串为"abcd",则分别对应的字符为a、c,然后用这两个字符分别和第三个参数字

符串数组里对应的字符串匹配,如参数为["a", "cd"],分别从字符a和c开始与字符串

参数进行匹配,刚好两个匹配的结果都相等,这时就可以用第四个参数targets中的每

个字符串,替换掉字符串参数里匹配成功的字符串。如果其中有一个或两个匹配不想

等,则不相等的不能够替换。

(如果觉得我描述有问题的,或对我代码有改进的欢迎大家留言~~

代码还是js写的提交用时60ms)

代码如下:

传入参数:S="vmokgggqzp",indexes=[3,5,1],sources=["kg","ggq","mo"],targets=["s","so","nfr"]

输出:

传入参数:S="abcd",indexes=[0,2],sources=["a", "cd"],targets=["eee","ffff"]

输出:

传入参数:S="abcd",indexes=[0,2],sources=["ab", "ec"],targets=["eee","ffff"]

输出:

注:最后一个传入的参数中source数组中的第二个字符串与字符串参数没有匹配成功,所以

第二个字符串不能替换。

 

 

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值