Leetcode-Basic/FirstUniqueChar.java at main · kavya-7777/Leetcode-Basic · GitHub

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
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
<<<<<<< HEAD
//387. First Unique Character in a String

class Solution {
    public int firstUniqChar(String s) {
        int[] len = new int[26];
        for(int i=0;i<s.length();i++){
            len[s.charAt(i) - 'a']++;
        }
        for(int i=0;i<s.length();i++){
            if(len[s.charAt(i) - 'a'] == 1) return i;
        }
        return -1;
    }
}

/*
class Solution {
    public int firstUniqChar(String s) {
        for(int i=0;i<s.length();i++){
            boolean isUnique = true;
            int count = 1;
            for(int j=0;j<s.length();j++){
                if(i != j && s.charAt(i) == s.charAt(j)){
                    isUnique = false;
                    break;
                }
            }
            if(isUnique) return i;
        }
        return -1;
    }
}
=======
//387. First Unique Character in a String

class Solution {
    public int firstUniqChar(String s) {
        int[] len = new int[26];
        for(int i=0;i<s.length();i++){
            len[s.charAt(i) - 'a']++;
        }
        for(int i=0;i<s.length();i++){
            if(len[s.charAt(i) - 'a'] == 1) return i;
        }
        return -1;
    }
}

/*
class Solution {
    public int firstUniqChar(String s) {
        for(int i=0;i<s.length();i++){
            boolean isUnique = true;
            int count = 1;
            for(int j=0;j<s.length();j++){
                if(i != j && s.charAt(i) == s.charAt(j)){
                    isUnique = false;
                    break;
                }
            }
            if(isUnique) return i;
        }
        return -1;
    }
}
>>>>>>> be6ce0b427078b1421d5dd74adb2300dc02daeec
*/