2351-2354 added.

liuyubobobo · liuyubobobo · commit f04ecb3fc8d7 · 2022-07-24T00:48:22.000-07:00
diff --git a/2001-2500/2349-Design-a-Number-Container-System/cpp-2349/main.cpp b/2001-2500/2349-Design-a-Number-Container-System/cpp-2349/main.cpp
@@ -10,6 +10,8 @@ using namespace std;
 
 
 /// Using Map
+/// Time Complecity: O(logn) for every operation
+/// Space Compelxity: O(n)
 class NumberContainers {
 
 private:
diff --git a/2001-2500/2351-First-Letter-to-Appear-Twice/cpp-2351/CMakeLists.txt b/2001-2500/2351-First-Letter-to-Appear-Twice/cpp-2351/CMakeLists.txt
@@ -0,0 +1,6 @@
+cmake_minimum_required(VERSION 3.22)
+project(A)
+
+set(CMAKE_CXX_STANDARD 14)
+
+add_executable(A main.cpp)
diff --git a/2001-2500/2351-First-Letter-to-Appear-Twice/cpp-2351/main.cpp b/2001-2500/2351-First-Letter-to-Appear-Twice/cpp-2351/main.cpp
@@ -0,0 +1,31 @@
+/// Source : https://leetcode.com/problems/first-letter-to-appear-twice/
+/// Author : liuyubobobo
+/// Time   : 2022-07-23
+
+#include <iostream>
+#include <vector>
+
+using namespace std;
+
+
+/// Simulation
+/// Time Complexity: O(n)
+/// Space Complexity: O(1)
+class Solution {
+public:
+    char repeatedCharacter(string s) {
+
+        vector<int> f(26, 0);
+        for(char c: s){
+            f[c - 'a'] ++;
+            if(f[c - 'a'] == 2) return c;
+        }
+        return 'a';
+    }
+};
+
+
+int main() {
+
+    return 0;
+}
diff --git a/2001-2500/2352-Equal-Row-and-Column-Pairs/cpp-2352/CMakeLists.txt b/2001-2500/2352-Equal-Row-and-Column-Pairs/cpp-2352/CMakeLists.txt
@@ -0,0 +1,6 @@
+cmake_minimum_required(VERSION 3.22)
+project(B)
+
+set(CMAKE_CXX_STANDARD 14)
+
+add_executable(B main.cpp)
diff --git a/2001-2500/2352-Equal-Row-and-Column-Pairs/cpp-2352/main.cpp b/2001-2500/2352-Equal-Row-and-Column-Pairs/cpp-2352/main.cpp
@@ -0,0 +1,36 @@
+/// Source : https://leetcode.com/problems/equal-row-and-column-pairs/
+/// Author : liuyubobobo
+/// Time   : 2022-07-23
+
+#include <iostream>
+#include <vector>
+
+using namespace std;
+
+
+/// Brute Force
+/// Time Complexity: O(n^3)
+/// Space Complexity: O(n^2)
+class Solution {
+public:
+    int equalPairs(vector<vector<int>>& grid) {
+
+        int n = grid.size();
+
+        vector<vector<int>> cols(n, vector<int>(n));
+        for(int j = 0; j < n; j ++)
+            for(int i = 0; i < n; i ++) cols[j][i] = grid[i][j];
+
+        int res = 0;
+        for(int i = 0; i < n; i ++)
+            for(int j = 0; j < n; j ++)
+                res += grid[i] == cols[j];
+        return res;
+    }
+};
+
+
+int main() {
+
+    return 0;
+}
diff --git a/2001-2500/2353-Design-a-Food-Rating-System/cpp-2353/CMakeLists.txt b/2001-2500/2353-Design-a-Food-Rating-System/cpp-2353/CMakeLists.txt
@@ -0,0 +1,6 @@
+cmake_minimum_required(VERSION 3.22)
+project(C)
+
+set(CMAKE_CXX_STANDARD 14)
+
+add_executable(C main.cpp)
diff --git a/2001-2500/2353-Design-a-Food-Rating-System/cpp-2353/main.cpp b/2001-2500/2353-Design-a-Food-Rating-System/cpp-2353/main.cpp
@@ -0,0 +1,54 @@
+/// Source : https://leetcode.com/problems/design-a-food-rating-system/
+/// Author : liuyubobobo
+/// Time   : 2022-07-23
+
+#include <iostream>
+#include <vector>
+#include <map>
+#include <set>
+
+using namespace std;
+
+
+/// Using Map
+/// Time Complexity: O(logn) for every operation
+/// Space Complexity: O(n)
+class FoodRatings {
+
+private:
+    map<string, map<int, set<string>>> tree;
+    map<string, pair<string, int>> food;
+
+public:
+    FoodRatings(vector<string>& foods, vector<string>& cuisines, vector<int>& ratings) {
+
+        int n = foods.size();
+        for(int i = 0; i < n; i ++){
+            food[foods[i]] = {cuisines[i], ratings[i]};
+            tree[cuisines[i]][ratings[i]].insert(foods[i]);
+        }
+    }
+
+    void changeRating(string food_name, int newRating) {
+
+        pair<string, int> p = food[food_name];
+        string cuision = p.first;
+        int oldRating = p.second;
+
+        tree[cuision][oldRating].erase(food_name);
+        if(tree[cuision][oldRating].empty()) tree[cuision].erase(oldRating);
+        tree[cuision][newRating].insert(food_name);
+
+        food[food_name].second = newRating;
+    }
+
+    string highestRated(string cuisine) {
+        return *(tree[cuisine].rbegin()->second.begin());
+    }
+};
+
+
+int main() {
+
+    return 0;
+}
diff --git a/2001-2500/2354-Number-of-Excellent-Pairs/cpp-2354/CMakeLists.txt b/2001-2500/2354-Number-of-Excellent-Pairs/cpp-2354/CMakeLists.txt
@@ -0,0 +1,6 @@
+cmake_minimum_required(VERSION 3.22)
+project(D)
+
+set(CMAKE_CXX_STANDARD 14)
+
+add_executable(D main.cpp)
diff --git a/2001-2500/2354-Number-of-Excellent-Pairs/cpp-2354/main.cpp b/2001-2500/2354-Number-of-Excellent-Pairs/cpp-2354/main.cpp
@@ -0,0 +1,67 @@
+/// Source : https://leetcode.com/problems/number-of-excellent-pairs/
+/// Author : liuyubobobo
+/// Time   : 2022-07-24
+
+#include <iostream>
+#include <vector>
+#include <set>
+#include <map>
+
+using namespace std;
+
+
+/// bitwise
+/// Time Compelxity: O(nlogn(max_a))
+/// Space Complexity: O(n)
+class Solution {
+public:
+    long long countExcellentPairs(vector<int>& nums, int k) {
+
+        map<int, int> ones;
+        for(int e: nums){
+            if(ones.count(e)) continue;
+            ones[e] = get_ones(e);
+        }
+
+        vector<int> cnt(63, 0);
+        for(const pair<int, int>& p: ones)
+            cnt[p.second] ++;
+
+        for(int i = 61; i >= 0; i --)
+            cnt[i] += cnt[i + 1];
+
+        long long res = 0;
+        for(const pair<int, int>& p: ones){
+            int e = p.first;
+            int one = p.second;
+
+            int t = max(k - one, 0);
+            res += cnt[t];
+        }
+        return res;
+    }
+
+private:
+    int get_ones(int e){
+        int res = 0;
+        while(e){
+            res ++;
+            e &= (e - 1);
+        }
+        return res;
+    }
+};
+
+
+int main() {
+
+    vector<int> nums1 = {1, 2, 3, 1};
+    cout << Solution().countExcellentPairs(nums1, 3) << '\n';
+    // 5
+
+    vector<int> nums2 = {5, 1, 1};
+    cout << Solution().countExcellentPairs(nums2, 10) << '\n';
+    // 0
+
+    return 0;
+}
diff --git a/readme.md b/readme.md
@@ -2203,6 +2203,10 @@ email: [liuyubobobo@gmail.com](mailto:liuyubobobo@gmail.com)
 | 2348 | [Number of Zero-Filled Subarrays](https://leetcode.com/problems/number-of-zero-filled-subarrays/) | [无] | [C++](2001-2500/2348-Number-of-Zero-Filled-Subarrays/cpp-2348/) | | |
 | 2349 | [Design a Number Container System](https://leetcode.com/problems/design-a-number-container-system/) | [无] | [C++](2001-2500/2349-Design-a-Number-Container-System/cpp-2349/) | | |
 | 2350 | [Shortest Impossible Sequence of Rolls](https://leetcode.com/problems/shortest-impossible-sequence-of-rolls/) | [无] | [C++](2001-2500/2350-Shortest-Impossible-Sequence-of-Rolls/cpp-2350/) | | |
+| 2351 | [First Letter to Appear Twice](https://leetcode.com/problems/first-letter-to-appear-twice/) | [无] | [C++](2001-2500/2351-First-Letter-to-Appear-Twice/cpp-2351/) | | |
+| 2352 | [Equal Row and Column Pairs](https://leetcode.com/problems/equal-row-and-column-pairs/) | [无] | [C++](2001-2500/2352-Equal-Row-and-Column-Pairs/cpp-2352/) | | |
+| 2353 | [Design a Food Rating System](https://leetcode.com/problems/design-a-food-rating-system/) | [无] | [C++](2001-2500/2353-Design-a-Food-Rating-System/cpp-2353/) | | |
+| 2354 | [Number of Excellent Pairs](https://leetcode.com/problems/number-of-excellent-pairs/) | [无] | [C++](2001-2500/2354-Number-of-Excellent-Pairs/cpp-2354/) | | |
 | | | | | | |
 
 ## 力扣中文站比赛
