387. First Unique Character in a String 难度:easy
来源:互联网 发布:淘宝的雷锋侠 编辑:程序博客网 时间:2024/04/30 08:23
题目:
Given a string, find the first non-repeating character in it and return it's index. If it doesn't exist, return -1.
Examples:
s = "leetcode"return 0.s = "loveleetcode",return 2.
思路:
首先这里假设只有小写字母,自然想到开一个大小为26的数组,保存每个字母出现的次数,然后在扫描一次字符串。
程序:
class Solution {public: int firstUniqChar(string s) { int len = s.length(), i; map<char, int> map1; for(i = 0; i < len; i++){ map1[s[i]]++; } for(i = 0; i < len; i++){ if(map1[s[i]] == 1) return i; } return -1; }};
0 0
- 387. First Unique Character in a String 难度:easy
- 387. First Unique Character in a String [easy] (Python)
- Leetcode 387. First Unique Character in a String (Easy) (cpp)
- 387. First Unique Character in a String
- 387.First Unique Character in a String
- 387. First Unique Character in a String
- 387. First Unique Character in a String
- 387. First Unique Character in a String
- 387. First Unique Character in a String
- 387. First Unique Character in a String
- 387. First Unique Character in a String
- 387. First Unique Character in a String
- 387. First Unique Character in a String
- 387. First Unique Character in a String
- 387. First Unique Character in a String
- 387. First Unique Character in a String
- 387. First Unique Character in a String
- 387. First Unique Character in a String
- 再看泛型
- 精通 CSS+DIV 网页样式与布局 157
- 音视频框架-webrtc中的网络反馈与控制
- c++爬虫大众点评数据(未完成)
- php-控制成分
- 387. First Unique Character in a String 难度:easy
- Socket网络编程系列教程序
- php表单GET和POST的区别
- 精通 CSS+DIV 网页样式与布局 158
- BadgeView
- 微擎管理微信公众号
- 数据库sqlite
- spring redis mysql 修改 redis cachekey,增加cachekey的复杂度 。
- 王小草【机器学习】笔记--提升之XGBoost工具的应用