西安交通大学915-2016-编程1

• 遍历一次序列 时间复杂度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;
}