@YipCubed/

leet-first-unique-char

C++11

No description

fork
loading
Files
  • main.cpp
  • core
  • README.md
main.cpp
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
#include <cstring>
#include <climits>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>


using namespace std;

// Live coding problems, watch at
// https://www.twitch.tv/yipcubed
// https://www.youtube.com/channel/UCTV_UOPu7EWXvYWsBFxMsSA/videos
//

// makes code faster, but larger. Just for LeetCode fun!
#pragma GCC optimise ("Ofast")

// makes stdin not synced so it is faster. Just for LeetCode fun!
static auto x = [](){ios_base::sync_with_stdio(false); cin.tie(NULL); return NULL;}();

class Solution {
public:
    // a- z 97-122
    int firstUniqChar(string s) {
      vector<int> seen(27);
      for (int i = 0; i < s.length(); ++i) {
        ++seen[s[i] - 'a'];
      }
      for (int i = 0; i < s.length(); ++i) {
        if (seen[s[i] - 'a'] == 1)
          return i;
      }
      return -1;
    }
};

void test1() {
  Solution S;
  cout << "0? " << Solution().firstUniqChar("leetcode") << endl;
  cout << "2? " << Solution().firstUniqChar("loveleetcode") << endl;
}

void test2() {
  Solution S;
}

void test3() {
  Solution S;
}

int main() {
  test1();
  test2();
  test3();
  cout << "Done!" << endl;
  
  return 0;
}