Skip to content

feat: add solutions to lc problems: No.0557,576 #3967

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Jan 18, 2025
Merged

feat: add solutions to lc problems: No.0557,576 #3967

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
85 changes: 46 additions & 39 deletions solution/0500-0599/0557.Reverse Words in a String III/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -53,7 +53,11 @@ tags:

<!-- solution:start -->

### 方法一
### 方法一：模拟

我们可以将字符串 $\textit{s}$ 按照空格分割成单词数组 $\textit{words}$，然后将每个单词反转后再拼接成字符串。

时间复杂度 $O(n)$，空间复杂度 $O(n)$。其中 $n$ 为字符串 $\textit{s}$ 的长度。

<!-- tabs:start -->

Expand All @@ -62,22 +66,19 @@ tags:
```python
class Solution:
def reverseWords(self, s: str) -> str:
return ' '.join([t[::-1] for t in s.split(' ')])
return " ".join(t[::-1] for t in s.split())
```

#### Java

```java
class Solution {
public String reverseWords(String s) {
StringBuilder res = new StringBuilder();
for (String t : s.split(" ")) {
for (int i = t.length() - 1; i >= 0; --i) {
res.append(t.charAt(i));
}
res.append(" ");
String[] words = s.split(" ");
for (int i = 0; i < words.length; ++i) {
words[i] = new StringBuilder(words[i]).reverse().toString();
}
return res.substring(0, res.length() - 1);
return String.join(" ", words);
}
}
```
Expand All @@ -88,14 +89,16 @@ class Solution {
class Solution {
public:
string reverseWords(string s) {
for (int i = 0, n = s.size(); i < n; ++i) {
int j = i;
while (++j < n && s[j] != ' ')
;
reverse(s.begin() + i, s.begin() + j);
i = j;
stringstream ss(s);
string t;
string ans;
while (ss >> t) {
reverse(t.begin(), t.end());
ans += t;
ans.push_back(' ');
}
return s;
ans.pop_back();
return ans;
}
};
```
Expand All @@ -104,18 +107,13 @@ public:

```go
func reverseWords(s string) string {
t := []byte(s)
for i := 0; i < len(t); i++ {
j := i
for j < len(t) && t[j] != ' ' {
j++
}
for st, ed := i, j-1; st < ed; st, ed = st+1, ed-1 {
t[st], t[ed] = t[ed], t[st]
}
i = j
words := strings.Fields(s)
for i, w := range words {
t := []byte(w)
slices.Reverse(t)
words[i] = string(t)
}
return string(t)
return strings.Join(words, " ")
}
```

Expand All @@ -124,14 +122,8 @@ func reverseWords(s string) string {
```ts
function reverseWords(s: string): string {
return s
.split(/\s+/)
.map(str => {
let res = '';
for (const c of str) {
res = c + res;
}
return res;
})
.split(' ')
.map(t => t.split('').reverse().join(''))
.join(' ');
}
```
Expand All @@ -149,6 +141,21 @@ impl Solution {
}
```

#### JavaScript

```js
/**
* @param {string} s
* @return {string}
*/
var reverseWords = function (s) {
return s
.split(' ')
.map(t => t.split('').reverse().join(''))
.join(' ');
};
```

#### PHP

```php
Expand All @@ -158,11 +165,11 @@ class Solution {
* @return String
*/
function reverseWords($s) {
$sArr = explode(' ', $s);
for ($i = 0; $i < count($sArr); $i++) {
$sArr[$i] = strrev($sArr[$i]);
$words = explode(' ', $s);
foreach ($words as $i => $word) {
$words[$i] = strrev($word);
}
return implode(' ', $sArr);
return implode(' ', $words);
}
}
```
Expand Down
85 changes: 46 additions & 39 deletions solution/0500-0599/0557.Reverse Words in a String III/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -51,7 +51,11 @@ tags:

<!-- solution:start -->

### Solution 1
### Solution 1: Simulation

We can split the string $\textit{s}$ into an array of words $\textit{words}$ by spaces, then reverse each word and concatenate them back into a string.

The time complexity is $O(n)$, and the space complexity is $O(n)$. Here, $n$ is the length of the string $\textit{s}$.

<!-- tabs:start -->

Expand All @@ -60,22 +64,19 @@ tags:
```python
class Solution:
def reverseWords(self, s: str) -> str:
return ' '.join([t[::-1] for t in s.split(' ')])
return " ".join(t[::-1] for t in s.split())
```

#### Java

```java
class Solution {
public String reverseWords(String s) {
StringBuilder res = new StringBuilder();
for (String t : s.split(" ")) {
for (int i = t.length() - 1; i >= 0; --i) {
res.append(t.charAt(i));
}
res.append(" ");
String[] words = s.split(" ");
for (int i = 0; i < words.length; ++i) {
words[i] = new StringBuilder(words[i]).reverse().toString();
}
return res.substring(0, res.length() - 1);
return String.join(" ", words);
}
}
```
Expand All @@ -86,14 +87,16 @@ class Solution {
class Solution {
public:
string reverseWords(string s) {
for (int i = 0, n = s.size(); i < n; ++i) {
int j = i;
while (++j < n && s[j] != ' ')
;
reverse(s.begin() + i, s.begin() + j);
i = j;
stringstream ss(s);
string t;
string ans;
while (ss >> t) {
reverse(t.begin(), t.end());
ans += t;
ans.push_back(' ');
}
return s;
ans.pop_back();
return ans;
}
};
```
Expand All @@ -102,18 +105,13 @@ public:

```go
func reverseWords(s string) string {
t := []byte(s)
for i := 0; i < len(t); i++ {
j := i
for j < len(t) && t[j] != ' ' {
j++
}
for st, ed := i, j-1; st < ed; st, ed = st+1, ed-1 {
t[st], t[ed] = t[ed], t[st]
}
i = j
words := strings.Fields(s)
for i, w := range words {
t := []byte(w)
slices.Reverse(t)
words[i] = string(t)
}
return string(t)
return strings.Join(words, " ")
}
```

Expand All @@ -122,14 +120,8 @@ func reverseWords(s string) string {
```ts
function reverseWords(s: string): string {
return s
.split(/\s+/)
.map(str => {
let res = '';
for (const c of str) {
res = c + res;
}
return res;
})
.split(' ')
.map(t => t.split('').reverse().join(''))
.join(' ');
}
```
Expand All @@ -147,6 +139,21 @@ impl Solution {
}
```

#### JavaScript

```js
/**
* @param {string} s
* @return {string}
*/
var reverseWords = function (s) {
return s
.split(' ')
.map(t => t.split('').reverse().join(''))
.join(' ');
};
```

#### PHP

```php
Expand All @@ -156,11 +163,11 @@ class Solution {
* @return String
*/
function reverseWords($s) {
$sArr = explode(' ', $s);
for ($i = 0; $i < count($sArr); $i++) {
$sArr[$i] = strrev($sArr[$i]);
$words = explode(' ', $s);
foreach ($words as $i => $word) {
$words[$i] = strrev($word);
}
return implode(' ', $sArr);
return implode(' ', $words);
}
}
```
Expand Down
18 changes: 10 additions & 8 deletions solution/0500-0599/0557.Reverse Words in a String III/Solution.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,13 +1,15 @@
class Solution {
public:
string reverseWords(string s) {
for (int i = 0, n = s.size(); i < n; ++i) {
int j = i;
while (++j < n && s[j] != ' ')
;
reverse(s.begin() + i, s.begin() + j);
i = j;
stringstream ss(s);
string t;
string ans;
while (ss >> t) {
reverse(t.begin(), t.end());
ans += t;
ans.push_back(' ');
}
return s;
ans.pop_back();
return ans;
}
};
};
19 changes: 7 additions & 12 deletions solution/0500-0599/0557.Reverse Words in a String III/Solution.go
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,14 +1,9 @@
func reverseWords(s string) string {
t := []byte(s)
for i := 0; i < len(t); i++ {
j := i
for j < len(t) && t[j] != ' ' {
j++
}
for st, ed := i, j-1; st < ed; st, ed = st+1, ed-1 {
t[st], t[ed] = t[ed], t[st]
}
i = j
words := strings.Fields(s)
for i, w := range words {
t := []byte(w)
slices.Reverse(t)
words[i] = string(t)
}
return string(t)
}
return strings.Join(words, " ")
}
13 changes: 5 additions & 8 deletions solution/0500-0599/0557.Reverse Words in a String III/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,12 +1,9 @@
class Solution {
public String reverseWords(String s) {
StringBuilder res = new StringBuilder();
for (String t : s.split(" ")) {
for (int i = t.length() - 1; i >= 0; --i) {
res.append(t.charAt(i));
}
res.append(" ");
String[] words = s.split(" ");
for (int i = 0; i < words.length; ++i) {
words[i] = new StringBuilder(words[i]).reverse().toString();
}
return res.substring(0, res.length() - 1);
return String.join(" ", words);
}
}
}
10 changes: 10 additions & 0 deletions solution/0500-0599/0557.Reverse Words in a String III/Solution.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,10 @@
/**
* @param {string} s
* @return {string}
*/
var reverseWords = function (s) {
return s
.split(' ')
.map(t => t.split('').reverse().join(''))
.join(' ');
};
8 changes: 4 additions & 4 deletions solution/0500-0599/0557.Reverse Words in a String III/Solution.php
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -4,10 +4,10 @@ class Solution {
* @return String
*/
function reverseWords($s) {
$sArr = explode(' ', $s);
for ($i = 0; $i < count($sArr); $i++) {
$sArr[$i] = strrev($sArr[$i]);
$words = explode(' ', $s);
foreach ($words as $i => $word) {
$words[$i] = strrev($word);
}
return implode(' ', $sArr);
return implode(' ', $words);
}
}
2 changes: 1 addition & 1 deletion solution/0500-0599/0557.Reverse Words in a String III/Solution.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,3 +1,3 @@
class Solution:
def reverseWords(self, s: str) -> str:
return ' '.join([t[::-1] for t in s.split(' ')])
return " ".join(t[::-1] for t in s.split())
Loading
Loading