Reverse Words in a String--leetcode

Given an input string, reverse the string word by word.

For example,
Given s = " the sky is blue ",
Return " blue is sky the ".

Update (2015-02-12):
For C programmers:try to solve it in-place in O(1) space.

Click to show Clarification.

Clarification:

• What constitutes a word?
  A sequence of non-space characters constitutes a word.
• Could the input string contain leading or trailing spaces?
  Yes. However, your reversed string should not contain leading or trailing spaces.
• How about multiple spaces between and words?
  Reduce them to a single space in the reversed string.

Title: Give a string, separated by a space, to reverse the string in the word unit.

Problem-solving ideas: With the Java own split, split the group, and then combine ...

     Publicstring Reversewords (string s) {if(s = =NULL|| S.length () = = 0) {            returns; } string[] Res= S.split (""); if(Res.length = = 0) {            return""; } StringBuilder SB=NewStringBuilder ();  for(inti = res.length-1; I >= 0; i--) {            if("". Equals (Res[i])) {                Continue; } sb.append (Res[i]). Append (" "); }        returnSb.substring (0, Sb.length ()-1); }

Reverse Words in a String--leetcode