给定一个字符串,你需要反转字符串中每个单词的字符顺序,同时仍保留空格和单词的初始顺序。
示例 1:
输入: "Let's take LeetCode contest"
输出: "s'teL ekat edoCteeL tsetnoc"
注意:在字符串中,每个单词由单个空格分隔,并且字符串中不会有任何额外的空格。
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/reverse-words-in-a-string-iii
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
char * reverseWords(char * s){
char *p = s;
char *q = NULL;
char *ps = s;
char temp = 0;
while(*ps != '\0'){
if (*(ps + 1) == ' ' || *(ps + 1) == '\0'){
q = ps;
while (p < q){
temp = *p;
*p++ = *q;
*q-- = temp;
}
p = ps + 2;
}
ps++;
}
return s;
}