ID | Title | Difficulty | |
---|---|---|---|
Loading... |
387. First Unique Character in a String
Easy
LeetCode
Hash Table, String, Queue, Counting
Problem
Given a string, find the first non-repeating character in it and return its index. If it doesn’t exist, return -1.
Examples:
s = "leetcode"
return 0.
s = "loveleetcode"
return 2.
Code
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;
}
}
按 <- 键看上一题!
386. Lexicographical Numbers
按 -> 键看下一题!
388. Longest Absolute File Path