LeetCode 151. Reverse Words in a String

• 题目描述：
  Given an input string, reverse the string word by word.

Example 1:

Input: "the sky is blue"
Output: "blue is sky the"

Example 2:

Input: "  hello world!  "
Output: "world! hello"
Explanation: Your reversed string should not contain leading or trailing spaces.

Example 3:

Input: "a good   example"
Output: "example good a"
Explanation: You need to reduce multiple spaces between two words to a single space in the reversed string.

Note:
A word is defined as a sequence of non-space characters.
Input string may contain leading or trailing spaces. However, your reversed string should not contain leading or trailing spaces.
You need to reduce multiple spaces between two words to a single space in the reversed string.

• 解题思路：
  先整个字符串整体翻转一次，然后再分别翻转每一个单词（或者先分别翻转每一个单词，然后再整个字符串整体翻转一次），此时就能得到我们需要的结果
• 代码：

class Solution {
	public String reverseWords(String s) {
		if (s == null || s.length() < 2)
			return s;
		char[] arr = s.toCharArray();
		int left = 0, right = s.length() - 1;
		// 完全翻转
		reverse(arr,left,right);
		//翻转单个单词
		reverseWord(arr);
		//空格处理
		return cleanSpaces(arr);
	}
 
	private String cleanSpaces(char[] arr) {
		int n=arr.length;
		int i=0,j=0;
		while(j<n){
			while(j<n&&arr[j]==' ')
				j++;
			while(j<n&&arr[j]!=' '){
				arr[i++]=arr[j++];
			}
			while(j<n&&arr[j]==' ')
				j++;
			if(j<n)
				arr[i++]=' ';
		}
		return new String(arr).substring(0,i);
	}
	
	private void reverseWord(char[] arr) {
		int n=arr.length,i=0,j=0;
		while(j<n){
			while(i<j||i<n&&arr[i]==' ')
				i++;
			while(j<i||j<n&&arr[j]!=' ')
				j++;
			reverse(arr,i,j-1);
		}
	}

	private void reverse(char[] arr, int left, int right) {
		while(left<right){
			char temp=arr[left];
			arr[left]=arr[right];
			arr[right]=temp;
			left++;
			right--;
		}
	}
}