leetcode-Reverse Words in a String

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

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

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 two words?
  Reduce them to a single space in the reversed string.

 多余的空格需要去掉

思路：先整体翻转一次，再每个单词单独翻转一次。进行单词单独翻转的同时进行多余空格的移除。

      start记录1个单独的开始，end记录1个单词的末尾，i：遍历，j：记录下一个插入位置，用来移除空格

代码：

void reverse(string &s,int start,int end)
{
int len=end-start+1;
int i=start;
while(i<(start+end+1)>>1)
{
char temp=s[i];
s[i]=s[end+start-i];
s[end+start-i]=temp;
++i;
}
}


void reverseWords(string &s) 
{

int len=s.length();
reverse(s,0,len-1);
int i=0; 
int j=0;
int start=-1;
int end=-1;
int count=0;
while(i<len)
{
if(s[i] == 32)
{
++count;
if(j>0 && count==1)
{
s[j++]=' ';
}
if(end==-1 && start!=-1)
{
end=j-2;
reverse(s,start,end);
start=-1;
end=-1;
}
++i;
}
else
{
count=0;
if(start==-1)
{
start=j;
}
s[j++]=s[i++];
}
}
if(s[len-1]==' ')
{
j=j-1;
}
else
{
end=j-1;
reverse(s,start,end);
}
if(j==-1)
{
s="";
}
else
{
s=s.substr(0,j);
}

}