1.vector<char>
#include<bits/stdc++.h> using namespace std; int main() { vector<char> q; char c, f; while ((c = cin.get()) != '.') { q.push_back(c); } q.push_back(c); cin >> c >> f; if (c == 'D') { for (int i = 0; i < q.size(); i++) { if (q[i] == f) { q.erase(q.begin() + i); break; } } } else if (c == 'I') { char m; cin >> m; for (int i = q.size() - 1; i >= 0; i--) { if (q[i] == f) { q.insert(q.begin() + i, m); break; } } } else if (c == 'R') { char m; cin >> m; for (int i = 0; i < q.size(); i++) { if (q[i] == f) q[i] = m; } } for (int i = 0; i < q.size(); i++) { cout << q[i]; } }
2.list<char>
#include<bits/stdc++.h> using namespace std; int main() { list<char> q; list<char>::iterator k; char c, f; while ((c = cin.get()) != '.') { q.push_back(c); } q.push_back(c); cin >> c >> f; if (c == 'D') { for (k = q.begin(); k != q.end(); k++) { if (*k == f) { k = q.erase(k); break; } } } else if (c == 'I') { char m; cin >> m; int i = 0; list<char>::iterator it; for (k = q.begin(); k != q.end(); k++) { if (*k == f) { it = k; i++; } } if (i > 0) q.insert(it, m); } else if (c == 'R') { char m; cin >> m; for (k = q.begin(); k != q.end(); k++) { if (*k == f) *k = m; } } for (k = q.begin(); k != q.end(); k++) { cout << *k; } }
0.0分
4 人评分
C语言训练-排序问题<1> (C++代码)浏览:588 |
【绝对值排序】 (C++代码)浏览:669 |
简单的a+b (C语言代码)浏览:573 |
C语言程序设计教程(第三版)课后习题7.2 (C语言代码)浏览:660 |
WU-输出正反三角形 (C++代码)浏览:1011 |
WU-printf基础练习2 (C++代码)浏览:1996 |
C语言程序设计教程(第三版)课后习题5.6 (C语言代码)浏览:899 |
关于C语言变量位置的问题浏览:270 |
A+B for Input-Output Practice (IV) (C语言代码)浏览:484 |
母牛的故事 (C语言代码)浏览:559 |