Given an input string , reverse the string word by word.
Example:
Input: ["t","h","e"," ","s","k","y"," ","i","s"," ","b","l","u","e"] Output: ["b","l","u","e"," ","i","s"," ","s","k","y"," ","t","h","e"]
Note:
Follow up: Could you do it in-place without allocating extra space?
two pointers
time: O(n), space: O(1)
class Solution { public void reverseWords(char[] s) { reverse(s, 0, s.length - 1); int i = 0, j = 0; while(j < s.length) { if(s[j] == ‘ ‘) { reverse(s, i, j - 1); j++; i = j; } else { j++; } } reverse(s, i, j - 1); } private void reverse(char[] c, int i, int j) { while(i < j) { char tmp = c[i]; c[i] = c[j]; c[j] = tmp; i++; j--; } } }
186. Reverse Words in a String II - Medium
原文：https://www.cnblogs.com/fatttcat/p/11340353.html