5 problems solved.

lintcoder · lintcoder · commit 317928932fc4 · 2018-11-22T22:01:00.000+08:00
diff --git a/src/884.cpp b/src/884.cpp
@@ -0,0 +1,48 @@
+vector<string> uncommonFromSentences(string A, string B) {
+        int len1 = A.size();
+        int len2 = B.size();
+        if (len1 == 0 && len2 == 0)
+            return {};
+        
+        map<string, int> mp;
+        string::size_type i = A.find_first_not_of(" ");
+        while (i != string::npos)
+        {
+            string::size_type pos = A.find(' ', i);
+            if (pos != string::npos)
+            {
+                mp[A.substr(i, pos-i)]++;
+                i = A.find_first_not_of(" ", pos+1);
+            }
+            else
+            {
+                mp[A.substr(i)]++;
+                break;
+            }
+        }
+        
+        i = B.find_first_not_of(" ");
+        while (i != string::npos)
+        {
+            string::size_type pos = B.find(' ', i);
+            if (pos != string::npos)
+            {
+                mp[B.substr(i, pos-i)]++;
+                i = B.find_first_not_of(" ", pos+1);
+            }
+            else
+            {
+                mp[B.substr(i)]++;
+                break;
+            }
+        }
+        
+        vector<string> res;
+        for (auto& m : mp)
+        {
+            if (m.second == 1)
+                res.push_back(m.first);
+        }
+        
+        return res;
+    }
diff --git a/src/893.cpp b/src/893.cpp
@@ -0,0 +1,28 @@
+int numSpecialEquivGroups(vector<string>& A) {
+        int len = A.size();
+        vector<vector<int>> vec(len, vector<int>(52, 0));
+        for (int i = 0; i < len; ++i)
+        {
+            int sz = A[i].size();
+            for (int j = 0; j < sz; ++j)
+            {
+                ++vec[i][j%2*26+A[i][j]-'a'];
+            }
+        }
+        
+        auto cmp = [](const vector<int>& a, const vector<int>& b) {
+            for (int i = 0; i < 52; ++i)
+            {
+                if (a[i] == b[i])
+                    continue;
+                else if (a[i] < b[i])
+                    return true;
+                else
+                    return false;
+            }
+            return false;
+        };
+        
+        sort(vec.begin(), vec.end(), cmp);
+        return unique(vec.begin(), vec.end()) - vec.begin();
+    }
diff --git a/src/905.cpp b/src/905.cpp
@@ -0,0 +1,17 @@
+vector<int> sortArrayByParity(vector<int>& A) {
+        int len = A.size();
+        if (len <= 1)
+            return A;
+        int i = 0, j = len-1;
+        while (i < j)
+        {
+            while (i < j && A[i]%2 == 0)
+                ++i;
+            while (i < j && A[j]%2 == 1)
+                --j;
+            if (i < j)
+                swap(A[i], A[j]);
+        }
+        
+        return A;
+    }
diff --git a/src/908.cpp b/src/908.cpp
@@ -0,0 +1,9 @@
+int smallestRangeI(vector<int>& A, int K) {
+        int len = A.size();
+        if (len <= 1)
+            return 0;
+        
+        sort(A.begin(), A.end());
+        int diff = A[len-1] - A[0];
+        return diff <= 2*K ? 0 : diff-2*K;
+    }
diff --git a/src/929.cpp b/src/929.cpp
@@ -0,0 +1,32 @@
+int numUniqueEmails(vector<string>& emails) {
+        int len = emails.size();
+        if (len <= 1)
+            return len;
+
+        set<string> uniqueEml;
+        for (int i = 0; i < len; ++i)
+        {
+            int sz = emails[i].size();
+            string res(sz, ' ');
+            int j = 0, k = 0;
+            while (j < sz && emails[i][j] != '@')
+            {
+                if (emails[i][j] == '+')
+                    break;
+                else if (emails[i][j] != '.')
+                    res[k++] = emails[i][j];
+                ++j;
+            }
+            while (emails[i][j] != '@')
+                ++j;
+            while (j < sz)
+            {
+                res[k] = emails[i][j];
+                ++j;
+                ++k;
+            }
+            uniqueEml.insert(res.substr(0, k));
+        }
+
+        return uniqueEml.size();
+    }
