algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-11 13:00:22 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update 0541.反转字符串II.md

Browse Source
This commit is contained in:
Jijie LIU
2022-10-19 22:20:01 +02:00
committed by GitHub
parent 9977fb5996
commit 77b431d276
1 changed files with 9 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

15
problems/0541.反转字符串II.md
View File

@ -399,14 +399,17 @@ object Solution {
} }
} }
``` ```
版本二: 首先利用sliding每隔k个进行分割，随后转换为数组，再使用zipWithIndex添加每个数组的索引，紧接着利用map做变换，如果索引%2==0则说明需要翻转，否则原封不动，最后再转换为String 版本二: 首先利用grouped每隔k个进行分割，再使用zipWithIndex添加每个数组的索引，紧接着利用map做变换，如果索引%2==0则说明需要翻转，否则原封不动，最后再转换为String
```scala ```scala
object Solution { object SolutionFunc {
def reverseStr(s: String, k: Int): String = { def reverseStr(s: String, k: Int): String = {
s.sliding(k, k) // s = "abcdefg", k = 2
.toArray s.grouped(k) // Iterator ["ab", "cd", "ef", "g"]
.zipWithIndex .zipWithIndex // Iterator [("ab", 0), ("cd", 1), ("ef", 2), ("g", 3)]
.map(v => if (v._2 % 2 == 0) v._1.reverse else v._1) .map {
case (subStr, index) =>
if (index % 2 == 0) subStr.reverse else subStr
}
.mkString .mkString
} }
} }