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

改了

Browse Source
This commit is contained in:
hbm666
2023-08-27 11:17:01 +08:00
parent e48b94f97d
commit 2393f86448
1 changed files with 4 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
problems/剑指Offer58-II.左旋转字符串.md
View File

@ -120,8 +120,9 @@ class Solution {
``` ```
```java ```java
//解法二：空间复杂度：O(1)。用原始数组来进行反转操作 // 解法二
//思路为：先整个字符串反转，再反转前面的，最后反转后面 n 个 // 空间复杂度：O(n)。String 的 toCharArray() 方法底层会 new 一个和原字符串相同大小的 char 数组
// 思路为：先整个字符串反转，再反转前面的，最后反转后面 n 个
class Solution { class Solution {
public String reverseLeftWords(String s, int n) { public String reverseLeftWords(String s, int n) {
char[] chars = s.toCharArray(); char[] chars = s.toCharArray();
@ -418,3 +419,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>