roma-dxunvrs
19 lines
480 B
Markdown
19 lines
480 B
Markdown
Leetcode #387 | #Easy | [[O(26)]] | [[Хэш-таблицы]]
|
||
## Идея
|
||
Идея с O(26)
|
||
## Big-O
|
||
- Время ```O(N)```
|
||
- Память ```O(N)```
|
||
## Код
|
||
```Java
|
||
class Solution {
|
||
public int firstUniqChar(String s) {
|
||
int[] count = new int[26];
|
||
for (int i = 0; i < s.length(); i++) count[s.charAt(i) - 'a']++;
|
||
for (int i = 0; i < s.length(); i++) {
|
||
if (count[s.charAt(i) - 'a'] == 1) return i;
|
||
}
|
||
return -1;
|
||
}
|
||
}
|
||
``` |