forked from gouthampradhan/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathFirstUniqueCharacterInAString.java
More file actions
44 lines (36 loc) · 997 Bytes
/
FirstUniqueCharacterInAString.java
File metadata and controls
44 lines (36 loc) · 997 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
package string;
/**
* Created by gouthamvidyapradhan on 09/03/2017.
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 FirstUniqueCharacterInAString
{
int[] CHAR = new int[256];
/**
* Main method
* @param args
* @throws Exception
*/
public static void main(String[] args) throws Exception
{
System.out.println(new FirstUniqueCharacterInAString().firstUniqChar("loveleetcode"));
}
public int firstUniqChar(String s)
{
if(s == null || s.isEmpty()) return -1;
for(int i = 0, l = s.length(); i < l; i ++)
CHAR[s.charAt(i)]++;
for(int i = 0, l = s.length(); i < l; i ++)
{
if(CHAR[s.charAt(i)] == 1)
return i;
}
return -1;
}
}