-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSolution.java
31 lines (30 loc) · 882 Bytes
/
Solution.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
/**
* @author changleamazing
* @date 2020/8/30 14:43 source: https://leetcode-cn.com/problems/reverse-words-in-a-string-iii/
**/
public class Solution {
public String reverseWords(String s) {
if (s == null || s.length() == 0) {
return s;
}
char[] ch = s.toCharArray();
int left = 0, right;
for (int i = 0; i < ch.length; i++) {
if (ch[i] == ' ' || i == ch.length - 1) {
right = ch[i] == ' ' ? i - 1 : ch.length - 1;
swap(ch, left, right);
left = i + 1;
}
}
return String.valueOf(ch);
}
private void swap(char[] ch, int left, int right) {
while (left < right) {
char temp = ch[left];
ch[left] = ch[right];
ch[right] = temp;
left++;
right--;
}
}
}