上周忘记交作业了，这周续上

MrFreezing · MrFreezing · commit bf74d73d7a40 · 2020-08-01T17:50:34.000+08:00
diff --git a/Week08/LeetCodes/1122_Relative_Sort_Array.cpp b/Week08/LeetCodes/1122_Relative_Sort_Array.cpp
@@ -0,0 +1,19 @@
+class Solution {
+public:
+    vector<int> relativeSortArray(vector<int>& arr1, vector<int>& arr2) {
+        map<int, int> map;
+        for (int i : arr1) map[i]++;
+        
+        int offset = 0;
+        vector<int> res(arr1.size(), 0);
+        for (int i : arr2) 
+            while(map[i]--)
+                res[offset++] = i;
+
+        for (auto &v : map) 
+            while (v.second-- > 0) 
+                res[offset++] = v.first;
+
+        return res;
+    }
+};
diff --git a/Week08/LeetCodes/190_Reverse_Bits.cpp b/Week08/LeetCodes/190_Reverse_Bits.cpp
@@ -0,0 +1,12 @@
+class Solution {
+public:
+    uint32_t reverseBits(uint32_t n) {
+        int res = 0;
+        for(int i = 0; i < 32; ++i)
+        {
+            res = (res << 1) + (n & 1);
+            n >>= 1;
+        }
+        return res;
+    }
+};
diff --git a/Week08/LeetCodes/191_Number_of_1_Bits.cpp b/Week08/LeetCodes/191_Number_of_1_Bits.cpp
@@ -0,0 +1,11 @@
+class Solution {
+public:
+    int hammingWeight(uint32_t n) {
+        int cnt = 0;
+        for (int i = 0; i < 32; i++) {
+            cnt += n & 1;
+            n = n >> 1;
+        }
+        return cnt;
+    }
+};
diff --git a/Week08/LeetCodes/231_Power_of_Two.cpp b/Week08/LeetCodes/231_Power_of_Two.cpp
@@ -0,0 +1,11 @@
+class Solution {
+public:
+    bool isPowerOfTwo(int n) {
+        if (n <= 0) return  false;
+        while (n > 1) {
+            if (n & 1) return false;
+            n = n >> 1;
+        }
+        return true;
+    }
+};
diff --git a/Week08/LeetCodes/242_Valid_Anagram.cpp b/Week08/LeetCodes/242_Valid_Anagram.cpp
@@ -0,0 +1,18 @@
+class Solution {
+public:
+    bool isAnagram(string s, string t) {
+        map<char, int> map1;
+        map<char, int> map2;
+        for (char c : s) map1[c]++;
+        for (char c : t) map2[c]++;
+
+        if (map1.size() != map2.size()) return false;
+
+        map<char, int>::iterator it1, it2;
+        for (it1 = map1.begin(), it2 = map2.begin(); it1 != map1.end(); it1++, it2++) 
+            if (it1->first != it2->first || it1->second != it2->second) 
+                return false;
+        
+        return true;
+    }
+};
diff --git a/Week08/NOTE.md b/Week08/NOTE.md
@@ -1 +1,51 @@
-学习笔记
+学习笔记
+
+
+1. 快速排序
+int parttion(int *arr, int begin, int end) {
+	if (begin < 0 || end < begin || !arr) 
+		return -1;
+	
+	int pis = arr[end];
+	int i = begin - 1;
+	for (int j = begin; j < end; j++) {
+		if (arr[j] <= pis) {
+			i++;
+			swap(arr[j], arr[i]);
+		}
+	}
+	swap(arr[i], arr[end]);
+	return i + 1;
+}
+
+void qsort(int *arr, int begin, int end) {
+	if (begin < 0 || end < begin || !arr) 
+		return;
+
+	stack<int> s;
+	s.push(end);
+	s.push(begin);
+
+	while (s.size()) {
+		int left = s.top();
+		s.pop();
+		int right = s.top();
+		s.pop();
+
+		int k = pattion(arr, left, right);
+		if (left < k) {
+			s.push(k - 1);
+			s.push(left));
+		}
+		if (right > k) {
+			s.push(right);
+			s.push(k + 1));
+		}
+	}
+}
+
+
+2. 位图
+	布隆过滤器
+	LRU
+	整数类算法题
