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

第二处问题修改

Browse Source
This commit is contained in:
hbm666
2023-08-27 20:15:48 +08:00
parent e48b94f97d
commit fd5a171e88
1 changed files with 2 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
problems/0151.翻转字符串里的单词.md
View File

@ -311,7 +311,7 @@ class Solution {
```
```java
//解法三：双反转+移位，在原始数组上进行反转。空间复杂度O(1)
//解法三：双反转+移位，String 的 toCharArray() 方法底层会 new 一个和原字符串相同大小的 char 数组，空间复杂度：O(n)
class Solution {
/**
* 思路：
@ -976,3 +976,4 @@ char * reverseWords(char * s){
<a href="https://programmercarl.com/other/kstar.html" target="_blank">
<img src="../pics/网站星球宣传海报.jpg" width="1000"/>
</a>