题目链接
https://www.patest.cn/contests/gplt/L1-003
题意
计算每个不同数字出现的次数
思路 可以用 MAP标记， 也可以直接用数字 存
AC代码
#include <iostream> #include <cstdio> #include <algorithm> #include <cmath> #include <deque> #include <vector> #include <queue> #include <string> #include <cstring> #include <map> #include <stack> #include <set> #include <cstdlib> #include <ctype.h> #include <numeric> #include <sstream> using namespace std; typedef long long LL; const double PI = 3.14159265358979323846264338327; const double E = 2.718281828459; const double eps = 1e-6; const int MAXN = 0x3f3f3f3f; const int MINN = 0xc0c0c0c0; const int maxn = 1e5 + 5; const int MOD = 1e9 + 7; int main() { string s; cin >> s; int len = s.size(); map <char, int> m; m.clear(); for (int i = 0; i < len; i++) { m[s[i]] ++; } map <char, int>::iterator it; for (it = m.begin(); it != m.end(); it++) cout << it -> first << ":" << it -> second << endl; }转载于:https://www.cnblogs.com/Dup4/p/9433355.html
