| Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|
| 78105 | sh25_wangsj | 找第一个只出现一次的字符 | C++ | Accepted | 0 MS | 248 KB | 389 | 2025-12-26 15:22:15 |
#include <iostream> #include <unordered_map> using namespace std; int main() { string s; cin >> s; unordered_map<char, int> char_count; for (char c : s) { char_count[c]++; } for (char c : s) { if (char_count[c] == 1) { cout << c << endl; return 0; } } cout << "no" << endl; return 0; }