题目描述:
解题思路:
- 遍历一次序列 时间复杂度O(n)
代码实现:
#include <iostream>
#include <cstring>
using namespace std;
void RemoveDigitInStr(char *s) {
int n = strlen(s);
int i = 0;
int j = 0;
while (s[j] != '\0') {
if (!isdigit(s[j])) {
s[i++] = s[j++];
}
j++;
}
s[i] = '\0';
}
int main() {
char s[] = {"12904u09fifshidof2-3u9-s=93"};
RemoveDigitInStr(s);
cout << s << endl;
return 0;
}