
- 遍历一次序列 时间复杂度O(n)
#include#include using namespace std; void RemoveDigitInStr(char *s) { int n = strlen(s); int i = 0; int j = 0; while (s[j] != '') { if (!isdigit(s[j])) { s[i++] = s[j++]; } j++; } s[i] = ''; } int main() { char s[] = {"12904u09fifshidof2-3u9-s=93"}; RemoveDigitInStr(s); cout << s << endl; return 0; }
欢迎分享,转载请注明来源:内存溢出
微信扫一扫
支付宝扫一扫
评论列表(0条)