用find_first_of篩分字符串

Practice 9.47

#include <iostream> #include <queue> #include <string> #include <vector> #include <map> #include <algorithm> #include <list> #include <iterator> #include <cmath> #include <cstring> #include <forward_list> #include <sstream> using namespace std;string dic_of_number = "1234567890"; string res_of_number = ""; string res_of_alp = ""; int pos; void find_number(const string & s) {while(pos<(int)s.length() && (pos = s.find_first_of(dic_of_number,pos))) {res_of_number += s[pos];pos ++;} }void find_alp(const string & s) {while(pos<(int)s.length()) {pos = s.find_first_not_of(dic_of_number, pos);if(pos==-1) break;res_of_alp += s[pos];pos ++; } }int main() {res_of_number = "";res_of_alp = "";string s = "jin4hai8jia4";pos = 0;cout << "original string: " << s << endl;find_number(s);cout << "number string: ";cout << res_of_number << endl;pos = 0; find_alp(s); cout << "alp string: ";cout << res_of_alp << endl;return 0; }

Output

original string: jin4hai8jia4 number string: 484 alp string: jinhaijia

不矯情，想約你出去

總結(jié)

以上是生活随笔為你收集整理的金海佳学C++primer 练习9.47的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。