Lintcode1435 · Find And Replace in String go

/**
1435 · Find And Replace in String
Algorithms
Medium
Accepted Rate
63%

DescriptionSolutionNotesDiscussLeaderboard
Description
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.

0 \leq indexes.length = sources.length = targets.length \leq 1000≤indexes.length=sources.length=targets.length≤100
0 < indexes[i] < S.length \leq 10000<indexes[i]<S.length≤1000
All characters in given inputs are lowercase letters.
Example
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.
Tags
Company
Google

https://www.cnblogs.com/hyserendipity/p/9385934.html
https://www.cnblogs.com/zhzhlong/p/9706524.html

https://www.lintcode.com/problem/1435/
*/

//WA 本地测试是ok的，上线了 不对，很奇怪，有知道的朋友可以指点一下。

import (
	"fmt"
	"sort"
)

type twoSlice [][]int

func (t twoSlice) Len() int { return len(t) }
func (t twoSlice) Swap(i, j int) {
	t[i], t[j] = t[j], t[i]
}
func (t twoSlice) Less(i, j int) bool {
	return t[i][0] > t[j][0]
}

/**
 * @param S: a string
 * @param indexes: the index array
 * @param sources: the source array
 * @param targets: the target array
 * @return: the string after operation
 */
func findReplaceString(S string, indexes []int, sources []string, targets []string) string {
	// Write your code here.
	var ls twoSlice
	for i := 0; i < len(indexes); i++ {
		ls = append(ls, []int{indexes[i], i})
	}
	sort.Sort(ls)
	for k := 0; k < len(ls); k++ {
		var index int = ls[k][0]
		var i int = ls[k][1]
		var source string = sources[i]
		var target string = targets[i]
		if string(S[index:index+len(source)]) == source {
			S = string(S[0:index]) + target + string(S[index+len(source):])
		}
	}
	return S
}

func main() {
	//"abcd"
	//[0, 2]
	//["a", "cd"]
	//["eee", "ffff"]
	var res string = findReplaceString("abcd", []int{0, 2}, []string{"a", "cd"}, []string{"eee", "ffff"})
	fmt.Println(res)
}