摘要: 简单题,没什么好说的,Hash数组+两次遍历可破; int firstUniqChar(string s) { for (int i = 0; i < s.size(); i++) { hashtable[s[i] - 'a']++; } int index = 0; for (int i = 0; 阅读全文
posted @ 2020-12-23 08:47 暮云林凌 阅读(87) 评论(0) 推荐(0)