387. First Unique Character in a String(Java)
来源:互联网 发布:网络公关处理 编辑:程序博客网 时间:2024/06/08 10:40
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.
Note: You may assume the string contain only lowercase letters.
public class Solution { public int firstUniqChar(String s) { int[] freq = new int[26]; for (int i = 0; i < s.length(); i ++) { freq[s.charAt(i) - 'a'] ++; } for (int i = 0; i < s.length(); i ++) { if (freq[s.charAt(i) - 'a'] == 1) return i; } return -1; }}
阅读全文
0 0
- 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
- 387. First Unique Character in a String
- 387. First Unique Character in a String
- 387. First Unique Character in a String
- CodeForces 831B-Keyboard Layouts
- JAVA中的枚举类型
- 反转链表和查找倒数第K个节点
- 图像处理之Hessian矩阵提取关键点
- 自定义Toolbar以及使用
- 387. First Unique Character in a String(Java)
- android 中获取手机中安装的应用并做跳转的相关分析研究
- ipbrother告诉你方法,创建有意义的链接数!
- 软件测试就是找bug NO!
- android中 如何设置控件获取焦点
- [POJ1905]Expanding Rods
- jquery 根据当前元素获取上一级下一级元素
- bzoj 4548: 小奇的糖果 双向链表+树状数组
- 读书笔记-天机妙算刘伯温-1