feat: add question #lcp18

hi-dhl · hi-dhl · commit e4882d2f8b30 · 2022-07-31T17:25:34.000+08:00
diff --git a/code/_lcp18/Solution.cpp b/code/_lcp18/Solution.cpp
@@ -0,0 +1,29 @@
+//
+// Created by DHL on 2022/7/30.
+//
+
+class Solution {
+public:
+    int breakfastNumber(vector<int> &staple, vector<int> &drinks, int x) {
+        int *arr = new int[x + 1]();
+        int slen = staple.size();
+        for (int i = 0; i < slen; i++) {
+            if (staple[i] > x) continue;
+            arr[staple[i]]++;
+        }
+
+        for (int i = 1; i <= x; i++) {
+            arr[i] += arr[i - 1];
+        }
+
+        int dlen = drinks.size();
+        int ans = 0;
+        for (int i = 0; i < dlen; i++) {
+            if (drinks[i] > x) continue;
+            ans += arr[x - drinks[i]];
+            ans = ans % 1000000007;
+        }
+        delete[] arr;
+        return ans;
+    }
+};
