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

Merge pull request #2765 from ZaneCodeJourney/0541

Browse Source 
0541.反转字符串II 思路部分 纠正笔误
This commit is contained in:
程序员Carl
2024-10-12 13:07:34 +08:00
committed by GitHub
parent dbc93eb196 0c29c3ed1e
commit fa3460c3dd
1 changed files with 2 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -37,7 +37,7 @@
因为要找的也就是每2 * k 区间的起点，这样写，程序会高效很多。 因为要找的也就是每2 * k 区间的起点，这样写，程序会高效很多。
**所以当需要固定规律一段一段去处理字符串的时候，要想想在在for循环的表达式上做做文章。** **所以当需要固定规律一段一段去处理字符串的时候，要想想在for循环的表达式上做做文章。**
性能如下： 性能如下：
<img src='https://code-thinking.cdn.bcebos.com/pics/541_反转字符串II.png' width=600> </img></div> <img src='https://code-thinking.cdn.bcebos.com/pics/541_反转字符串II.png' width=600> </img></div>
@ -505,3 +505,4 @@ impl Solution {
<a href="https://programmercarl.com/other/kstar.html" target="_blank"> <a href="https://programmercarl.com/other/kstar.html" target="_blank">
<img src="../pics/网站星球宣传海报.jpg" width="1000"/> <img src="../pics/网站星球宣传海报.jpg" width="1000"/>
</a> </a>