From d8f3b40085619cb680c8f227c65a1f5acc393223 Mon Sep 17 00:00:00 2001
From: crupest <crupest@outlook.com>
Date: Tue, 23 Feb 2021 21:07:19 +0800
Subject: Move leetcode solutions to subdir.

---
 cpp/1052.cpp | 47 -----------------------------------------------
 1 file changed, 47 deletions(-)
 delete mode 100644 cpp/1052.cpp

(limited to 'cpp/1052.cpp')

diff --git a/cpp/1052.cpp b/cpp/1052.cpp
deleted file mode 100644
index 583e217..0000000
--- a/cpp/1052.cpp
+++ /dev/null
@@ -1,47 +0,0 @@
-#include <algorithm>
-// #include <iostream>
-#include <vector>
-
-using std::vector;
-
-class Solution {
-public:
-  int maxSatisfied(vector<int> &customers, vector<int> &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