test: 3439 solution

py, c++, go, java

Author: QuBenhao

problems/problems_3439/Solution.cpp

@@ -1,31 +1,52 @@
 //go:build ignore
 #include "cpp/common/Solution.h"
 
-
 using namespace std;
 using json = nlohmann::json;
 
 class Solution {
 public:
-    int maxFreeTime(int eventTime, int k, vector<int>& startTime, vector<int>& endTime) {
-        
+  int maxFreeTime(int eventTime, int k, const vector<int> &startTime,
+                  const vector<int> &endTime) {
+    int n = startTime.size();
+
+    auto getDistance = [&](int idx) {
+      if (idx == 0) {
+        return startTime[0];
+      } else if (idx == n) {
+        return eventTime - endTime[n - 1];
+      } else {
+        return startTime[idx] - endTime[idx - 1];
+      }
+    };
+
+    int cur = 0;
+    for (int i = 0; i <= k; ++i) {
+      cur += getDistance(i);
+    }
+    int ans = cur;
+    for (int i = k + 1; i <= n; ++i) {
+      cur += getDistance(i) - getDistance(i - k - 1);
+      ans = max(ans, cur);
     }
+    return ans;
+  }
 };
 
 json leetcode::qubh::Solve(string input_json_values) {
-	vector<string> inputArray;
-	size_t pos = input_json_values.find('\n');
-	while (pos != string::npos) {
-		inputArray.push_back(input_json_values.substr(0, pos));
-		input_json_values = input_json_values.substr(pos + 1);
-		pos = input_json_values.find('\n');
-	}
-	inputArray.push_back(input_json_values);
+  vector<string> inputArray;
+  size_t pos = input_json_values.find('\n');
+  while (pos != string::npos) {
+    inputArray.push_back(input_json_values.substr(0, pos));
+    input_json_values = input_json_values.substr(pos + 1);
+    pos = input_json_values.find('\n');
+  }
+  inputArray.push_back(input_json_values);
 
-	Solution solution;
-	int eventTime = json::parse(inputArray.at(0));
-	int k = json::parse(inputArray.at(1));
-	vector<int> startTime = json::parse(inputArray.at(2));
-	vector<int> endTime = json::parse(inputArray.at(3));
-	return solution.maxFreeTime(eventTime, k, startTime, endTime);
+  Solution solution;
+  int eventTime = json::parse(inputArray.at(0));
+  int k = json::parse(inputArray.at(1));
+  vector<int> startTime = json::parse(inputArray.at(2));
+  vector<int> endTime = json::parse(inputArray.at(3));
+  return solution.maxFreeTime(eventTime, k, startTime, endTime);
 }

problems/problems_3439/Solution.java

@@ -7,7 +7,26 @@
 
 public class Solution extends BaseSolution {
     public int maxFreeTime(int eventTime, int k, int[] startTime, int[] endTime) {
-        
+        int n = startTime.length;
+        int[] dist = new int[n + 1];
+        dist[0] = startTime[0];
+        dist[n] = eventTime - endTime[n - 1];
+        int cur = dist[0];
+        for (int i = 1; i <= k; ++i) {
+            if (i < n) {
+                dist[i] = startTime[i] - endTime[i - 1];
+            }
+            cur += dist[i];
+        }
+        int ans = cur;
+        for (int i = k + 1; i <= n; ++i) {
+            if (i < n) {
+                dist[i] = startTime[i] - endTime[i - 1];
+            }
+            cur += dist[i] - dist[i - k - 1];
+            ans = Math.max(ans, cur);
+        }
+        return ans;
     }
 
     @Override

problems/problems_3439/solution.go

@@ -6,8 +6,27 @@ import (
 	"strings"
 )
 
-func maxFreeTime(eventTime int, k int, startTime []int, endTime []int) int {
-    
+func maxFreeTime(eventTime int, k int, startTime []int, endTime []int) (ans int) {
+	n := len(startTime)
+	getDistance := func(idx int) int {
+		if idx == 0 {
+			return startTime[0]
+		}
+		if idx == n {
+			return eventTime - endTime[n-1]
+		}
+		return startTime[idx] - endTime[idx-1]
+	}
+	cur := 0
+	for i := range k + 1 {
+		cur += getDistance(i)
+	}
+	ans = cur
+	for i := k + 1; i <= n; i++ {
+		cur += getDistance(i) - getDistance(i-k-1)
+		ans = max(ans, cur)
+	}
+	return
 }
 
 func Solve(inputJsonValues string) any {

problems/problems_3439/solution.py

@@ -7,5 +7,20 @@ def solve(self, test_input=None):
         return self.maxFreeTime(*test_input)
 
     def maxFreeTime(self, eventTime: int, k: int, startTime: List[int], endTime: List[int]) -> int:
-        pass
+        n = len(startTime)
 
+        def get_dist(idx):
+            if idx == 0:
+                return startTime[0]
+            if idx == n:
+                return eventTime - endTime[-1]
+            return startTime[idx] - endTime[idx - 1]
+
+        cur = 0
+        for i in range(k + 1):
+            cur += get_dist(i)
+        ans = cur
+        for i in range(k + 1, n + 1):
+            cur += get_dist(i) - get_dist(i - k - 1)
+            ans = max(ans, cur)
+        return ans

problems/problems_3439/testcase

@@ -1,2 +1,2 @@
-["5\n1\n[1,3]\n[2,5]", "10\n1\n[0,2,9]\n[1,4,10]", "5\n2\n[0,1,2,3,4]\n[1,2,3,4,5]"]
-[2, 6, 0]
+["5\n1\n[1,3]\n[2,5]", "10\n1\n[0,2,9]\n[1,4,10]", "5\n2\n[0,1,2,3,4]\n[1,2,3,4,5]", "21\n1\n[7,10,16]\n[10,14,18]"]
+[2, 6, 0, 7]

problems/problems_3439/testcase.py

@@ -10,6 +10,7 @@ def __init__(self):
 		self.testcases.append(case(Input=[5, 1, [1, 3], [2, 5]], Output=2))
 		self.testcases.append(case(Input=[10, 1, [0, 2, 9], [1, 4, 10]], Output=6))
 		self.testcases.append(case(Input=[5, 2, [0, 1, 2, 3, 4], [1, 2, 3, 4, 5]], Output=0))
+		self.testcases.append(case(Input=[21,1,[7,10,16],[10,14,18]], Output=7))
 
 	def get_testcases(self):
 		return self.testcases