题目: 请实现一个函数,把字符串中的每个空格替换成“%20”, 例如输入“we are happy”, 则输出、
“we%20are%20happy”:
/*
show myCode :
题目来源: 《剑指offer》 何海涛 老师
面试题四: 替换字符串的空格
*/
#include<iostream>
#include<cstring>
using namespace std;
class Solution {
public:
void replaceBlank(char *str,int length)
{
if(str == NULL || length <= 0)
return;
char *pSrc = str;
int origin = 0;
int last = 0;
int nBlankCount = 0;
while(*str != '\0')
{
if(*str == ' ')
{
++nBlankCount;
}
++str;
++origin;
}
last = origin + nBlankCount * 2;
str = pSrc;
while(origin < last && origin >= 0)
{
if(str[origin] == ' ')
{
str[last--] = '0';
str[last--] = '2';
str[last--] = '%';
--origin;
}
else
{
str[last--] = str[origin--];
}
}
}
};
int main()
{
Solution s;
char a[50] = "h w";
cout << a << endl;
s.replaceBlank(a, 50);
cout << a << endl;
strcpy(a, "hello world ");
cout << a << endl;
s.replaceBlank(a, 50);
cout << a << endl;
strcpy(a, " hello world " );
cout << a << endl;
s.replaceBlank(a, 50);
cout << a << endl;
strcpy(a, " he l lo world ");
cout << a << endl;
s.replaceBlank(a, 50);
cout << a << endl;
strcpy(a, "hello world ");
cout << a << endl;
s.replaceBlank(a, 50);
cout << a << endl;
return 0;
}
// show the code of book
void ReplaceBlank(char string[], int length)
{
if(string == NULL || length <= 0)
return;
int originalLength = 0;
int numberOfBlank = 0;
int i = 0;
while(string[i] != '\0')
{
++originalLength;
if(string[i] == ' ')
++numberOfBlank;
++i;
}
int newLength = originalLength + numberOfBlank * 2;
if(newLength > length)
return;
int indexOfOriginal = originalLength;
int indexOfNew = newLength;
while(indexOfOriginal >= 0 && indexOfNew > indexOfOriginal)
{
if(string[indexOfOriginal] == ' ')
{
string[indexOfNew--] = '0';
string[indexOfNew--] = '2';
string[indexOfNew--] = '%';
}
else
{
string[indexOfNew--] = string[indexOfOriginal];
}
--indexOfOriginal;
}
}
小结与思考:
1)上面的代码是用双“指针”来实现的,注意很多算法可能从前往后实现往往得不到较优的算法, 往往从后往前开始可能会得到优化的算法实现;
2)思考相关题目: 合并两个有序数组,使得合并后的数组仍然有序;
参考资料:
《剑指offer》 何海涛 老师