Sep 11, 2023 · Aug 24, 2023 · Aug 27, 2023 · Aug 27, 2023 · Aug 27, 2023 · Sep 11, 2023
diff --git a/problems/剑指Offer58-II.左旋转字符串.md b/problems/剑指Offer58-II.左旋转字符串.md
Original file line number	Diff line number	Diff line change
Expand Up		@@ -120,8 +120,9 @@ class Solution {
		```

		```java
	//解法二:空间复杂度:O(1)。用原始数组来进行反转操作
	//思路为:先整个字符串反转,再反转前面的,最后反转后面 n 个
	// 解法二
	// 空间复杂度:O(n)。String 的 toCharArray() 方法底层会 new 一个和原字符串相同大小的 char 数组
	// 思路为:先整个字符串反转,再反转前面的,最后反转后面 n 个
		class Solution {
		public String reverseLeftWords(String s, int n) {
		char[] chars = s.toCharArray();
Expand Down Expand Up		@@ -418,3 +419,4 @@ impl Solution {
		<a href="https://programmercarl.com/other/kstar.html" target="_blank">
		<img src="../pics/网站星球宣传海报.jpg" width="1000"/>
		</a>