Commit d220687

committed

add 424

1 parent 2e736b8 commit d220687Copy full SHA for d220687

File tree

+49

-0

lines changed

+49

-0

lines changed

Lines changed: 27 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,27 @@`
	`1`	`+`
	`2`	`+# 0424.longest-repeating-character-replacement`
	`3`	`+`
	`4`	+```text
	`5`	`+给你一个仅由大写英文字母组成的字符串,你可以将任意位置上的字符替换成另外的字符,总共可最多替换 k 次。在执行上述操作后,找到包含重复字母的最长子串的长度。`
	`6`	`+`
	`7`	`+注意:字符串长度和 k 不会超过 104。`
	`8`	`+`
	`9`	`+`
	`10`	`+`
	`11`	`+示例 1:`
	`12`	`+`
	`13`	`+输入:s = "ABAB", k = 2`
	`14`	`+输出:4`
	`15`	`+解释:用两个'A'替换为两个'B',反之亦然。`
	`16`	`+示例 2:`
	`17`	`+`
	`18`	`+输入:s = "AABABBA", k = 1`
	`19`	`+输出:4`
	`20`	`+解释:`
	`21`	`+将中间的一个'A'替换为'B',字符串变为 "AABBBBA"。`
	`22`	`+子串 "BBBB" 有最长重复字母, 答案为 4。`
	`23`	`+`
	`24`	`+来源:力扣(LeetCode)`
	`25`	`+链接:https://leetcode-cn.com/problems/longest-repeating-character-replacement`
	`26`	`+著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。`
	`27`	+```

Lines changed: 14 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,14 @@`
	`1`	`+package replacement`
	`2`	`+`
	`3`	`+import "fmt"`
	`4`	`+`
	`5`	`+func Run() {`
	`6`	`+ s := ""`
	`7`	`+ k := 1`
	`8`	`+ c := characterReplacement(s, k)`
	`9`	`+ fmt.Println(c)`
	`10`	`+}`
	`11`	`+`
	`12`	`+func characterReplacement(s string, k int) int {`
	`13`	`+`
	`14`	`+}`

Lines changed: 8 additions & 0 deletions

Comments

(0)