Merge pull request #1250 from barryxt/master

melody-li · web-flow · commit 67e98c2ae724 · 2019-12-12T18:44:04.000+08:00
536-Week 08
diff --git a/Week 08/id_536/leetcode_387_536.cpp b/Week 08/id_536/leetcode_387_536.cpp
@@ -0,0 +1,28 @@
+#include <iostream>
+#include <map>
+
+using namespace std;
+//ʱ�临�Ӷȣ�O(n)��nΪ�ַ����ĳ���
+//�ռ临�Ӷȣ�O(n)
+class Solution {
+public:
+    int firstUniqChar(string s) {
+        //unordered_map<char,int> mapS;
+        map<char,int> mapS;
+        for(auto c : s)
+            ++ mapS[c];
+        for(int i = 0; i < s.size(); ++i) {
+           if(mapS[s[i]] == 1)
+               return i;
+        }
+        return -1;
+    }
+};
+
+int main()
+{
+    Solution s;
+    int res = s.firstUniqChar("lol");
+    cout << res << endl;
+    return 0;
+}
diff --git a/Week 08/id_536/leetcode_58_536.cpp b/Week 08/id_536/leetcode_58_536.cpp
@@ -0,0 +1,28 @@
+#include <iostream>
+#include <string>
+
+using namespace std;
+
+class Solution {
+public:
+    int lengthOfLastWord(string s) {
+        int res = 0;
+        for(int i = s.length()-1; i >= 0; --i) {
+            if(s[i] != ' ')
+                ++ res;
+            else {
+                if(res)
+                    break;
+            }
+        }
+        return res;
+    }
+};
+
+int main()
+{
+    Solution s;
+    int res = s.lengthOfLastWord("djfks djsjd dd 23234");
+    cout << res << endl;
+    return 0;
+}
diff --git a/Week 08/id_536/leetcode_771_536.cpp b/Week 08/id_536/leetcode_771_536.cpp
@@ -0,0 +1,74 @@
+#include <iostream>
+#include <string>
+#include <set>
+#include <map>
+
+using namespace std;
+
+class Solution {
+public:
+    /*****
+     �ⷨ1��������
+            ʱ�临�Ӷȣ�O(J*S)
+            �ռ临�Ӷȣ�O(1)
+     *****/
+    int helper1(string J, string S) {
+         int res = 0;
+         for(int i = 0; i < S.length(); ++ i) {
+            for(int j = 0; j < J.length(); ++ j) {
+                if(S[i] == J[j]) {
+                    ++ res;
+                }
+            }
+         }
+         return res;
+    }
+
+    /*****
+     �ⷨ2��setʵ��
+            ʱ�临�Ӷȣ�O(J+S)
+            �ռ临�Ӷȣ�O(J)
+     *****/
+    int helper2(string J, string S) {
+         int res = 0;
+         //unordered_set<char> setJ(J.begin(),J.end());
+         set<char> setJ(J.begin(),J.end());
+         for(int i = 0; i < S.length(); ++i) {
+             if(setJ.count(S[i]))
+                ++ res;
+         }
+         return res;
+    }
+
+    /*****
+     �ⷨ3��mapʵ��
+            ʱ�临�Ӷȣ�O(J+S)
+            �ռ临�Ӷȣ�O(J)
+     *****/
+    int helper3(string J, string S) {
+         int res = 0;
+         //unordered_map<char,int> mapJ;
+         map<char,int> mapJ;
+         for(auto c : J)
+            mapJ[c] = 1;
+         for(auto c : S)
+            res += mapJ[c];
+         return res;
+    }
+
+    int numJewelsInStones(string J, string S) {
+         int res = 0;
+         //res = helper1(J,S);
+         //res = helper2(J,S);
+         res = helper3(J,S);
+         return res;
+    }
+};
+
+int main()
+{
+    Solution s;
+    int res = s.numJewelsInStones("aA","aAAbbbb");
+    cout << res << endl;
+    return 0;
+}
