p387

LeetCode p387 First Unique Character in a String 题解

1.题目:

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.

题意:

输入一个字符串,找到第一个没有重复过的字母的位置。

2.解题思路:

用数组标记是否重复,循环2次即出结果。

3.代码


[title] [] [url] [link text]
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
 
public class {
public int firstUniqChar(String s) {
char[] c = s.toCharArray();
int[] a = new int[257];
for (int i = 0; i < c.length; i++) {
a[c[i]]++;
}
for (int i = 0; i < c.length; i++) {
if (a[c[i]] == 1)
return i;
}
return -1;
}
}

4.一些总结: