387. First Unique Character in a String
来源:互联网 发布:淘宝用户积分查询 编辑:程序博客网 时间:2024/06/07 17:00
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.
思路:开个26个数的数组,然后先对字符串过一遍,统计每个字母出现的次数,然后从头再国一遍,第一个字母数为1的即为首先出现并且只出现一次的字母。
public class Solution { public int firstUniqChar(String s) { int[] a = new int[26]; for(int i = 0; i < s.length(); i++) a[s.charAt(i) - 'a']++; for(int i = 0; i < s.length(); i++){ if(a[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
- linux系统备份以及自定义liveCD的制作
- 【方法】STM32F407单片机SDIO接口上插入多张SD卡并进行通信
- CSS 高级语法有哪些?
- MySQL操作详解
- 网易编程(数列还原)
- 387. First Unique Character in a String
- Java面试题全集(上)
- 向量空间模型(VSM)在文档相似度计算上的简单介绍
- IOS模拟器运行报错:resource fork, Finder information, or similar detritus not allowed
- VB.NET
- 磁盘管理2--磁盘加密
- 一点C++学习资源
- 转载:http://blog.csdn.net/u010128736/ ORB-SLAM2详解(四)跟踪
- 如何利用github打造博客专属域名