2

Author: hitzzc

README.md

@@ -264,6 +264,9 @@ Golang solution for leetcode. For each problem, there is a simple *_test.go to t
 #### [383. Ransom Note](https://github.com/hitzzc/go-leetcode/tree/master/ransom_note)
 #### [384. Shuffle an Array](https://github.com/hitzzc/go-leetcode/tree/master/shuffle_an_array)
 #### [386. Lexicographical Numbers](https://github.com/hitzzc/go-leetcode/tree/master/lexicographical_numbers)
+#### [387. First Unique Character in a String](https://github.com/hitzzc/go-leetcode/tree/master/first_unique_character_in_a_string)
+#### [388. Longest Absolute File Path](https://github.com/hitzzc/go-leetcode/tree/master/longest_absolute_file_path)
+
 
 
 

first_unique_character_in_a_string/first_unique_character_in_a_string.cpp

@@ -0,0 +1,13 @@
+class Solution {
+public:
+    int firstUniqChar(string s) {
+        unordered_map<char, int> m;
+        for (auto& ch: s) {
+        	++m[ch];
+        }
+        for (int i = 0; i < s.size(); ++i) {
+        	if (m[s[i]] == 1) return i; 
+        }
+        return -1;
+    }
+};

longest_absolute_file_path/longest_absolute_file_path.cpp

@@ -0,0 +1,24 @@
+class Solution {
+public:
+    int lengthLongestPath(string input) {
+    	unordered_map<int, int> depth;
+    	int level = 0, res = 0;
+    	for (int i = 0; i < input.size(); ++i) {
+    		int start = i;
+    		while (i < input.size() && input[i] != '\n' && input[i] != '\t') ++i;
+    		if (i == input.size() || input[i] == '\n') {
+    			string name = input.substr(start, i-start);
+    			if (name.find('.') != string::npos) {
+    				res = max(res, depth[level] + (int)name.size());
+    			}else {
+    				++level;
+    				depth[level] = depth[level-1] + (int)name.size() + 1;	 
+    			}
+    			level = 0;
+    		}else {
+    			++level;
+    		}
+    	}
+    	return res;
+    }
+};