From dc1f0c4c0096013799416664894c5194dc7e1f52 Mon Sep 17 00:00:00 2001 From: Yuqian Yang Date: Fri, 28 Feb 2025 23:13:39 +0800 Subject: chore(store): move everything to store. --- works/solutions/leetcode/cpp/1052.cpp | 47 ----------------------------------- 1 file changed, 47 deletions(-) delete mode 100644 works/solutions/leetcode/cpp/1052.cpp (limited to 'works/solutions/leetcode/cpp/1052.cpp') diff --git a/works/solutions/leetcode/cpp/1052.cpp b/works/solutions/leetcode/cpp/1052.cpp deleted file mode 100644 index 583e217..0000000 --- a/works/solutions/leetcode/cpp/1052.cpp +++ /dev/null @@ -1,47 +0,0 @@ -#include -// #include -#include - -using std::vector; - -class Solution { -public: - int maxSatisfied(vector &customers, vector &grumpy, int X) { - int customer_count = customers.size(); - - int total_customer_count = 0; - int total_unsatisfied_customer_count = 0; - - for (int i = 0; i < X; i++) { - total_customer_count += customers[i]; - if (grumpy[i]) { - total_unsatisfied_customer_count += customers[i]; - } - } - - int current_suppress_customer_count = total_unsatisfied_customer_count; - int max_suppress_customer_count = total_unsatisfied_customer_count; - - for (int i = X; i < customer_count; i++) { - total_customer_count += customers[i]; - if (grumpy[i]) { - total_unsatisfied_customer_count += customers[i]; - current_suppress_customer_count += customers[i]; - } - - if (grumpy[i - X]) { - current_suppress_customer_count -= customers[i - X]; - } - - max_suppress_customer_count = std::max(max_suppress_customer_count, - current_suppress_customer_count); - } - - // std::cout << total_customer_count << '\n'; - // std::cout << total_unsatisfied_customer_count << '\n'; - // std::cout << max_suppress_customer_count << '\n'; - - return total_customer_count - total_unsatisfied_customer_count + - max_suppress_customer_count; - } -}; -- cgit v1.2.3