标签：return 没有 end i++ 复试 cin turn class 示例
#include <iostream> #include <vector> #include <map> using namespace std; int main() { int a[100], num[100] = {0}, n, i = 0, j; vector<int> v; map<int, int> m; while (scanf("%d", &n)) { if (n == 0) break; if (m[n] == 0) { v.push_back(n); m[n]++; } if (v.size() > 3) { m[v[0]] = 0; v.erase(v.begin()); } for (i = v.size() - 1; i >= 0; i--) { cout << v[i]; if (i > 0) cout << ","; } } return 0; }
#include <iostream> #include <vector> #include <map> using namespace std; int main() { int a[100], num[100] = {0}, n, i = 0, j; vector<int> v, vv; map<int, int> m; while (scanf("%d", &n)) { if (n == 0) break; if (m[n] == 0) { v.push_back(n); m[n]++; n = 0; if (v.size() > 3) { m[v[0]] = 0; v.erase(v.begin()); } } else { for (i = v.size() - 1; i >= 0; i--) { if (v[i] == n) { v.erase(v.begin() + i); v.push_back(n); } } } for (i = v.size() - 1; i >= 0; i--) { cout << v[i]; if (i > 0) cout << ","; } cout << endl; } return 0; }
#include <iostream> #include <vector> #include <map> using namespace std; int main() { string s; while (cin >> s) { int cnt = 0, i, l, maxn = 0; l = s.length(); for (i = 0; i < l; i++) { if (s[i] == ‘(‘) { cnt++; if (cnt > maxn) maxn = cnt; } if (s[i] == ‘)‘) cnt--; } cout << maxn << endl; } return 0; }
PS: 总感觉这个第三题是不是没有这么简单啊？ 扎实一点 踏实一点
标签：return 没有 end i++ 复试 cin turn class 示例
原文地址：https://www.cnblogs.com/ache/p/12571737.html
