test: 3683, 3684, 3685, 3686 solution

py, c++, go

Author: QuBenhao

daily-problems.json

@@ -1,4 +1,4 @@
 {
     "daily": "966",
-    "plans": ["3678", "problems", "3679", "problems", "3681", "problems"]
+    "plans": ["3683", "problems", "3684", "problems", "3685", "problems", "3686", "problems"]
 }

golang/problems_test.go

@@ -1,14 +1,16 @@
 package golang
 
 import (
-	problem3678 "leetCode/problems/problems_3678"
-	problem3679 "leetCode/problems/problems_3679"
-	problem3681 "leetCode/problems/problems_3681"
+	problem3683 "leetCode/problems/problems_3683"
+	problem3684 "leetCode/problems/problems_3684"
+	problem3685 "leetCode/problems/problems_3685"
+	problem3686 "leetCode/problems/problems_3686"
 	"testing"
 )
 
 func TestSolutions(t *testing.T) {
-	TestEach(t, "3678", "problems", problem3678.Solve)
-	TestEach(t, "3679", "problems", problem3679.Solve)
-	TestEach(t, "3681", "problems", problem3681.Solve)
+	TestEach(t, "3683", "problems", problem3683.Solve)
+	TestEach(t, "3684", "problems", problem3684.Solve)
+	TestEach(t, "3685", "problems", problem3685.Solve)
+	TestEach(t, "3686", "problems", problem3686.Solve)
 }

problems/problems_3683/Solution.cpp

@@ -0,0 +1,31 @@
+//go:build ignore
+#include "cpp/common/Solution.h"
+
+using namespace std;
+using json = nlohmann::json;
+
+class Solution {
+public:
+  int earliestTime(const vector<vector<int>> &tasks) {
+    int mn = 201;
+    for (const auto &task : tasks) {
+      mn = min(mn, task[0] + task[1]);
+    }
+    return mn;
+  }
+};
+
+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);
+
+  Solution solution;
+  vector<vector<int>> tasks = json::parse(inputArray.at(0));
+  return solution.earliestTime(tasks);
+}

problems/problems_3683/Solution.java

@@ -0,0 +1,22 @@
+package problems.problems_3683;
+
+import com.alibaba.fastjson.JSON;
+import java.util.*;
+import qubhjava.BaseSolution;
+
+
+public class Solution extends BaseSolution {
+    public int earliestTime(int[][] tasks) {
+        int mn = 201;
+        for (int[] task: tasks) {
+            mn = Math.min(mn, task[0] + task[1]);
+        }
+        return mn;
+    }
+
+    @Override
+    public Object solve(String[] inputJsonValues) {
+        int[][] tasks = jsonArrayToInt2DArray(inputJsonValues[0]);
+        return JSON.toJSON(earliestTime(tasks));
+    }
+}

problems/problems_3683/problem.md

@@ -0,0 +1,41 @@
+# 3683. Earliest Time to Finish One Task 
+
+<p>You are given a 2D integer array <code>tasks</code> where <code>tasks[i] = [s<sub>i</sub>, t<sub>i</sub>]</code>.</p>
+
+<p>Each <code>[s<sub>i</sub>, t<sub>i</sub>]</code> in <code>tasks</code> represents a task with start time <code>s<sub>i</sub></code> that takes <code>t<sub>i</sub></code> units of time to finish.</p>
+
+<p>Return the earliest time at which at least one task is finished.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">tasks = [[1,6],[2,3]]</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">5</span></p>
+
+<p><strong>Explanation:</strong></p>
+
+<p>The first task starts at time <code>t = 1</code> and finishes at time <code>1 + 6 = 7</code>. The second task finishes at time <code>2 + 3 = 5</code>. You can finish one task at time 5.</p>
+</div>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">tasks = [[100,100],[100,100],[100,100]]</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">200</span></p>
+
+<p><strong>Explanation:</strong></p>
+
+<p>All three tasks finish at time <code>100 + 100 = 200</code>.</p>
+</div>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= tasks.length &lt;= 100</code></li>
+	<li><code>tasks[i] = [s<sub>i</sub>, t<sub>i</sub>]</code></li>
+	<li><code>1 &lt;= s<sub>i</sub>, t<sub>i</sub> &lt;= 100</code></li>
+</ul>

problems/problems_3683/problem_zh.md

@@ -0,0 +1,43 @@
+# 3683. 完成一个任务的最早时间 
+
+<p>给你一个二维整数数组 <code>tasks</code>，其中 <code>tasks[i] = [s<sub>i</sub>, t<sub>i</sub>]</code>。</p>
+
+<p>数组中的每个 <code>[s<sub>i</sub>, t<sub>i</sub>]</code> 表示一个任务，该任务的开始时间为 <code>s<sub>i</sub></code>，完成该任务需要 <code>t<sub>i</sub></code> 个时间单位。</p>
+
+<p>返回至少完成一个任务的最早时间。</p>
+
+<p>&nbsp;</p>
+
+<p><strong class="example">示例 1：</strong></p>
+
+<div class="example-block">
+<p><strong>输入：</strong> <span class="example-io">tasks = [[1,6],[2,3]]</span></p>
+
+<p><strong>输出：</strong> <span class="example-io">5</span></p>
+
+<p><strong>解释：</strong></p>
+
+<p>第一个任务从时间 <code>t = 1</code> 开始，并在 <code>1 + 6 = 7</code> 时完成。第二个任务在时间 <code>t = 2</code> 开始，并在 <code>2 + 3 = 5</code> 时完成。因此，最早完成的任务在时间 5。</p>
+</div>
+
+<p><strong class="example">示例 2：</strong></p>
+
+<div class="example-block">
+<p><strong>输入：</strong> <span class="example-io">tasks = [[100,100],[100,100],[100,100]]</span></p>
+
+<p><strong>输出：</strong> <span class="example-io">200</span></p>
+
+<p><strong>解释：</strong></p>
+
+<p>三个任务都在时间 <code>100 + 100 = 200</code> 时完成。</p>
+</div>
+
+<p>&nbsp;</p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li><code>1 &lt;= tasks.length &lt;= 100</code></li>
+	<li><code>tasks[i] = [s<sub>i</sub>, t<sub>i</sub>]</code></li>
+	<li><code>1 &lt;= s<sub>i</sub>, t<sub>i</sub> &lt;= 100</code></li>
+</ul>

problems/problems_3683/solution.go

@@ -0,0 +1,26 @@
+package problem3683
+
+import (
+	"encoding/json"
+	"log"
+	"strings"
+)
+
+func earliestTime(tasks [][]int) (ans int) {
+	ans = 201
+	for _, task := range tasks {
+		ans = min(ans, task[0]+task[1])
+	}
+	return
+}
+
+func Solve(inputJsonValues string) any {
+	inputValues := strings.Split(inputJsonValues, "\n")
+	var tasks [][]int
+
+	if err := json.Unmarshal([]byte(inputValues[0]), &tasks); err != nil {
+		log.Fatal(err)
+	}
+
+	return earliestTime(tasks)
+}

problems/problems_3683/solution.py

@@ -0,0 +1,11 @@
+import solution
+from typing import *
+
+
+class Solution(solution.Solution):
+    def solve(self, test_input=None):
+        return self.earliestTime(test_input)
+
+    def earliestTime(self, tasks: List[List[int]]) -> int:
+        return min(s + t for s, t in tasks)
+

problems/problems_3683/testcase

@@ -0,0 +1,2 @@
+["[[1,6],[2,3]]", "[[100,100],[100,100],[100,100]]"]
+[5, 200]

problems/problems_3683/testcase.py

@@ -0,0 +1,14 @@
+from collections import namedtuple
+import testcase
+
+case = namedtuple("Testcase", ["Input", "Output"])
+
+
+class Testcase(testcase.Testcase):
+	def __init__(self):
+		self.testcases = []
+		self.testcases.append(case(Input=[[1, 6], [2, 3]], Output=5))
+		self.testcases.append(case(Input=[[100, 100], [100, 100], [100, 100]], Output=200))
+
+	def get_testcases(self):
+		return self.testcases