Merge pull request #91 from Joshua-Lu/patch-7

添加 0151.翻转字符串里的单词 Java版本
This commit is contained in:
Carl Sun
2021-05-14 09:57:44 +08:00
committed by GitHub

View File

@ -212,79 +212,76 @@ public:
Java Java
```java
```Java
class Solution { class Solution {
public String reverseWords(String s) { /**
char[] chars = s.toCharArray(); * 不使用Java内置方法实现
// 1.双指针去除空格 * <p>
// 去除头尾空格 * 1.去除首尾以及中间多余空格
int head = 0; * 2.反转整个字符串
while (chars[head] == ' ') { * 3.反转各个单词
head ++; */
} public String reverseWords(String s) {
int tail = chars.length - 1; // System.out.println("ReverseWords.reverseWords2() called with: s = [" + s + "]");
while (chars[tail] == ' ') { // 1.去除首尾以及中间多余空格
tail --; StringBuilder sb = removeSpace(s);
} // 2.反转整个字符串
reverseString(sb, 0, sb.length() - 1);
// 3.反转各个单词
reverseEachWord(sb);
return sb.toString();
}
// 去除中间空格 private StringBuilder removeSpace(String s) {
int p1 = head; // System.out.println("ReverseWords.removeSpace() called with: s = [" + s + "]");
int p2 = head + 1; int start = 0;
while (p2 <= tail) { int end = s.length() - 1;
if (chars[p2 -1] == ' ' && chars[p2] == ' ') { while (s.charAt(start) == ' ') start++;
p2 ++; while (s.charAt(end) == ' ') end--;
continue; StringBuilder sb = new StringBuilder();
} while (start <= end) {
chars[p1 + 1] = chars[p2]; char c = s.charAt(start);
p1 ++; if (c != ' ' || sb.charAt(sb.length() - 1) != ' ') {
p2 ++; sb.append(c);
} }
start++;
}
// System.out.println("ReverseWords.removeSpace returned: sb = [" + sb + "]");
return sb;
}
tail = p1; /**
* 反转字符串指定区间[start, end]的字符
*/
public void reverseString(StringBuilder sb, int start, int end) {
// System.out.println("ReverseWords.reverseString() called with: sb = [" + sb + "], start = [" + start + "], end = [" + end + "]");
while (start < end) {
char temp = sb.charAt(start);
sb.setCharAt(start, sb.charAt(end));
sb.setCharAt(end, temp);
start++;
end--;
}
// System.out.println("ReverseWords.reverseString returned: sb = [" + sb + "]");
}
// 2.双指针翻转整个字符串 private void reverseEachWord(StringBuilder sb) {
chars = reverse(chars, head, tail); int start = 0;
int end = 1;
// 3.双指针翻转每个单词 int n = sb.length();
p1 = head; while (start < n) {
p2 = head; while (end < n && sb.charAt(end) != ' ') {
end++;
for (int i = head; i <= tail;) { }
int add = 0; reverseString(sb, start, end - 1);
while (i + add <= tail && chars[i + add] != ' ') { start = end + 1;
add ++; end = start + 1;
} }
}
if (i + add != tail) {
reverse(chars, i, i + add - 1);
i += add + 1;
} else {
reverse(chars, i, tail);
i = tail + 1;
}
}
return new String(chars, head, tail - head + 1);
}
char[] reverse(char[] chars, int begin, int end) {
int p1 = begin;
int p2 = end;
while (p1 < p2) {
chars[p1] ^= chars[p2];
chars[p2] ^= chars[p1];
chars[p1] ^= chars[p2];
p1 ++;
p2 --;
}
return chars;
}
} }
``` ```
Python Python