题目:
思路:先删除空格,再整体反转,最后对每个单词进行反转。
1.删除空格
就是用双指针解决,快指针走在前面接受非空格的单词,慢指针标志新的字符串下标,注意while的循环条件就好。
void removeExtraSpace(char* s)
{
int slow, fast;
int size = strlen(s);
for (slow = 0, fast = 0; fast < size; fast++)
{
if (s[fast] != ' ')
//如果不是空格就输入,意思就是排除所有空格
{
if (slow != 0)
//进行一个单词之间加空格的操作,首位就不用加了
{
s[slow++] = ' ';
}
while (s[fast] != ' '&&fast<size)
{
s[slow] = s[fast];
fast++;
slow++;
}
}
}
s[slow] = '\0';
}
2.反转操作
这个写了很多次了,比较简单。
void reverse(char* s, int head, int tail)
{
int size = tail - head + 1;
for (int i = 0; i < size / 2; i++)
{
char temp = s[head];
s[head] = s[tail];
s[tail] = temp;
head++;
tail--;
}
}
还有一个就是分段反转的操作,遇到空格了就反转,比较好理解。
for (slow = 0, fast = 0; fast < size; fast++)
{
if (s[fast] == ' ')
{
reverse(s, slow, fast - 1);
slow = fast + 1;
}
if (fast == size - 1)
{
reverse(s, slow, fast);
}
}
整体代码:
void reverse(char* s, int head, int tail)
{
int size = tail - head + 1;
for (int i = 0; i < size / 2; i++)
{
char temp = s[head];
s[head] = s[tail];
s[tail] = temp;
head++;
tail--;
}
}
void removeExtraSpace(char* s)
{
int slow, fast;
int size = strlen(s);
for (slow = 0, fast = 0; fast < size; fast++)
{
if (s[fast] != ' ')
{
if (slow != 0)
{
s[slow++] = ' ';
}
while (s[fast] != ' '&&fast<size)
{
s[slow] = s[fast];
fast++;
slow++;
}
}
}
s[slow] = '\0';
}
char* reverseWords(char* s)
{
removeExtraSpace(s);
int size = strlen(s);
reverse(s, 0, size - 1);
int fast, slow;
for (slow = 0, fast = 0; fast < size; fast++)
{
if (s[fast] == ' ')
{
reverse(s, slow, fast - 1);
slow = fast + 1;
}
if (fast == size - 1)
{
reverse(s, slow, fast);
}
}
return s;
}
时间复杂度:O(N)
空间复杂度:O(1)