✨ feat: backup

Author: 李钊

1152.cpp

@@ -30,7 +30,6 @@ class Solution
         };
         map<tuple<string, string, string>, info> hash;
         iota(idx.begin(), idx.end(), 0);
-
         // Sort Time O(log(n))
         stable_sort(idx.begin(), idx.end(), [&time](int a, int b) { return time[a] < time[b]; });
         /*

1442.cpp

@@ -0,0 +1,19 @@
+#include <vector>
+
+using namespace std;
+
+class Solution
+{
+public:
+    int countTriplets(vector<int> &arr) {
+        int n = arr.size();
+        vector<int> prefix(n + 1, 0);
+        for (int i = 0; i < n; ++i) {
+            prefix[i + 1] = prefix[i] ^ arr[i];
+        }
+
+
+
+
+    }
+};

1829.cpp

@@ -0,0 +1,19 @@
+#include <vector>
+
+using namespace std;
+
+class Solution
+{
+public:
+    vector<int> getMaximumXor(vector<int> &nums, int maximumBit) {
+        int n = nums.size();
+        int acc = nums[0];
+        const int mask = (1 << maximumBit) - 1;
+        vector<int> ret(n, 0);
+        for (int i = 0; i < n; ++i) {
+            acc ^= i > 0 ? nums[i] : 0;
+            ret[n - 1 - i] = mask ^ acc;
+        }
+        return ret;
+    }
+};

2392.cpp

@@ -0,0 +1,43 @@
+#include <string>
+#include <vector>
+
+using namespace std;
+
+class Solution
+{
+public:
+    int garbageCollection(vector<string> &garbage, vector<int> &travel) {
+        int sum = 0, n = garbage.size();
+        int gaps[3] = {0};
+        int acc = 0;
+        for (int i = 0; i < n; ++i) {
+            acc += i > 0 ? travel[i - 1] : 0;
+            sum += garbage[i].size();
+            bool found[3] = {false};
+
+            for (auto c : garbage[i]) {
+                if (c == 'M') {
+                    gaps[0] = acc;
+                    found[0] = true;
+                    continue;
+                }
+                if (c == 'G') {
+                    gaps[1] = acc;
+                    found[1] = true;
+                    continue;
+                }
+
+                if (c == 'P') {
+                    gaps[2] = acc;
+                    found[2] = true;
+                    continue;
+                }
+
+                if (found[0] && found[1] && found[2])
+                    break;
+            }
+        }
+
+        return sum + gaps[0] + gaps[1] + gaps[2];
+    }
+};

799.cpp

@@ -0,0 +1,23 @@
+#include <vector>
+
+using namespace std;
+
+class Solution {
+ public:
+  double champagneTower(int poured, int query_row, int query_glass) {
+    vector<int> dp;
+    int sum = 0;
+    for (auto i = 0; i < query_row; i++) {
+      // Fill
+      if (i == 0) {
+        dp.push_back(1);
+        sum += 1;
+      }
+
+      // Judge
+      if (poured < sum) {
+        return 0.0;
+      }
+    }
+  }
+};

README.md

@@ -17,9 +17,12 @@
 # C++ Weapons
 
 
-## upper_bound
 
-return the first element that is less than the provided value.
+| Function                            | Method           |       |
+| :---------------------------------- | :--------------- | :---: |
+| Reverse a vector                    | std::reverse     |       |
+| First element less than provided    | std::upper_bound |       |
+| First element greater than provided | std::lower_bound |       |
+| Find string/characterin string      | std::string.find |       |
+|                                     |                  |       |
 
-
-## sort