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

Merge pull request #2257 from hbm666/br

Browse Source 
update 剑指Offer58-II.左旋转字符串 - Java错误注释修改
This commit is contained in:
程序员Carl
2023-09-11 09:45:25 +08:00
committed by GitHub
parent 44987cede3 a2f4933faa
commit 818612c4ae
1 changed files with 3 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
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();