LeetCode-First Unique Character in a String
2016-08-27 16:06
429 查看
Given a string, find the first non-repeating character in it and return it's index. If it doesn't exist,
return -1.
Examples:
Note: You may assume the string contain only lowercase letters.
题目含义:给一个字符串,找出字符串中第一个没有重复的字符,并返回他的索引,如果不存在则返回-1。可以假设字符串中只包含小写字母。
解题思路:由于题设字符串中只包含小写字母,所以可以建立一个26个元素的数组,统计字符串中各个字符出现的次数,然后再次遍历字符串,找到第一个出现次数只有1的元素,返回下标,若遍历完后未发现只出现1次的结果则返回-1.
return -1.
Examples:
Note: You may assume the string contain only lowercase letters.
题目含义:给一个字符串,找出字符串中第一个没有重复的字符,并返回他的索引,如果不存在则返回-1。可以假设字符串中只包含小写字母。
解题思路:由于题设字符串中只包含小写字母,所以可以建立一个26个元素的数组,统计字符串中各个字符出现的次数,然后再次遍历字符串,找到第一个出现次数只有1的元素,返回下标,若遍历完后未发现只出现1次的结果则返回-1.
public static int firstUniqChar(String s) { int index=0; char str[]=new char[s.length()]; str=s.toCharArray(); int low[]=new int[26]; for(int i=0;i<26;i++) { low[i]=0; } for(int i=0;i<str.length;i++) { low[(int)str[i]-(int)'a']++; } for(int i=0;i<str.length;i++) { if(low[(int)str[i]-(int)'a']==1) { index=i; return index; } } return -1; }
相关文章推荐
- Leetcode算法比赛----First Unique Character in a String
- LeetCode: First Unique Character in a String
- Leetcode: First Unique Character in a String
- 【LeetCode-387】First Unique Character in a String(C++)
- [Leetcode]First Unique Character in a String
- Leetcode 387 First Unique Character in a String
- LeetCode-First Unique Character in a String
- leetcode之First Unique Character in a String
- LeetCode 387:First Unique Character in a String
- 【LeetCode】387 First Unique Character in a String(java实现)
- [LeetCode] First Unique Character in a String(Java)
- [LeetCode] First Unique Character in a String 字符串第一个不同字符
- [Leetcode] First Unique Character in a String
- leetcode387:First Unique Character in a String
- LeetCode(387)First Unique Character in a String
- 384.[LeetCode]First Unique Character in a String
- leetcode 387 First Unique Character in a String C++
- LeetCode:First Unique Character in a String
- leetcode_387 First Unique Character in a String
- leetcode:First Unique Character in a String