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

添加 0151.翻转字符串里的单词 Java版本

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

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