feat: add solutions to lc problems: No.3633,3635

solution/3600-3699/3633.Earliest Finish Time for Land and Water Rides I/README.md

@@ -128,32 +128,129 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/3600-3699/3633.Ea
 
 <!-- solution:start -->
 
-### 方法一
+### 方法一：枚举 + 贪心
+
+我们可以考虑两种游乐设施的顺序，先玩陆地游乐设施再玩水上游乐设施，或者先玩水上游乐设施再玩陆地游乐设施。
+
+对于每种顺序，我们先计算出第一种游乐设施的最早结束时间 $\textit{minEnd}$，然后枚举第二种游乐设施，计算出第二种游乐设施的最早结束时间 $\max(\textit{minEnd}, \textit{startTime}) + \textit{duration}$，其中 $\textit{startTime}$ 是第二种游乐设施的开始时间。我们取所有可能的最早结束时间的最小值作为答案。
+
+最后，我们返回两种顺序的答案中的最小值。
+
+时间复杂度 $O(n + m)$，其中 $n$ 和 $m$ 分别是陆地游乐设施和水上游乐设施的数量。空间复杂度 $O(1)$。
 
 <!-- tabs:start -->
 
 #### Python3
 
 ```python
-
+class Solution:
+    def earliestFinishTime(self, landStartTime: List[int], landDuration: List[int], waterStartTime: List[int], waterDuration: List[int]) -> int:
+        def calc(a1, t1, a2, t2):
+            min_end = min(a + t for a, t in zip(a1, t1))
+            return min(max(a, min_end) + t for a, t in zip(a2, t2))
+
+        x = calc(landStartTime, landDuration, waterStartTime, waterDuration)
+        y = calc(waterStartTime, waterDuration, landStartTime, landDuration)
+        return min(x, y)
 ```
 
 #### Java
 
 ```java
-
+class Solution {
+    public int earliestFinishTime(
+        int[] landStartTime, int[] landDuration, int[] waterStartTime, int[] waterDuration) {
+        int x = calc(landStartTime, landDuration, waterStartTime, waterDuration);
+        int y = calc(waterStartTime, waterDuration, landStartTime, landDuration);
+        return Math.min(x, y);
+    }
+
+    private int calc(int[] a1, int[] t1, int[] a2, int[] t2) {
+        int minEnd = Integer.MAX_VALUE;
+        for (int i = 0; i < a1.length; ++i) {
+            minEnd = Math.min(minEnd, a1[i] + t1[i]);
+        }
+        int ans = Integer.MAX_VALUE;
+        for (int i = 0; i < a2.length; ++i) {
+            ans = Math.min(ans, Math.max(minEnd, a2[i]) + t2[i]);
+        }
+        return ans;
+    }
+}
 ```
 
 #### C++
 
 ```cpp
-
+class Solution {
+public:
+    int earliestFinishTime(vector<int>& landStartTime, vector<int>& landDuration, vector<int>& waterStartTime, vector<int>& waterDuration) {
+        int x = calc(landStartTime, landDuration, waterStartTime, waterDuration);
+        int y = calc(waterStartTime, waterDuration, landStartTime, landDuration);
+        return min(x, y);
+    }
+
+    int calc(vector<int>& a1, vector<int>& t1, vector<int>& a2, vector<int>& t2) {
+        int minEnd = INT_MAX;
+        for (int i = 0; i < a1.size(); ++i) {
+            minEnd = min(minEnd, a1[i] + t1[i]);
+        }
+        int ans = INT_MAX;
+        for (int i = 0; i < a2.size(); ++i) {
+            ans = min(ans, max(minEnd, a2[i]) + t2[i]);
+        }
+        return ans;
+    }
+};
 ```
 
 #### Go
 
 ```go
+func earliestFinishTime(landStartTime []int, landDuration []int, waterStartTime []int, waterDuration []int) int {
+	x := calc(landStartTime, landDuration, waterStartTime, waterDuration)
+	y := calc(waterStartTime, waterDuration, landStartTime, landDuration)
+	return min(x, y)
+}
+
+func calc(a1 []int, t1 []int, a2 []int, t2 []int) int {
+	minEnd := math.MaxInt32
+	for i := 0; i < len(a1); i++ {
+		minEnd = min(minEnd, a1[i]+t1[i])
+	}
+	ans := math.MaxInt32
+	for i := 0; i < len(a2); i++ {
+		ans = min(ans, max(minEnd, a2[i])+t2[i])
+	}
+	return ans
+}
+```
 
+#### TypeScript
+
+```ts
+function earliestFinishTime(
+    landStartTime: number[],
+    landDuration: number[],
+    waterStartTime: number[],
+    waterDuration: number[],
+): number {
+    const x = calc(landStartTime, landDuration, waterStartTime, waterDuration);
+    const y = calc(waterStartTime, waterDuration, landStartTime, landDuration);
+    return Math.min(x, y);
+}
+
+function calc(a1: number[], t1: number[], a2: number[], t2: number[]): number {
+    let minEnd = Number.MAX_SAFE_INTEGER;
+    for (let i = 0; i < a1.length; i++) {
+        minEnd = Math.min(minEnd, a1[i] + t1[i]);
+    }
+    let ans = Number.MAX_SAFE_INTEGER;
+    for (let i = 0; i < a2.length; i++) {
+        ans = Math.min(ans, Math.max(minEnd, a2[i]) + t2[i]);
+    }
+    return ans;
+}
 ```
 
 <!-- tabs:end -->

solution/3600-3699/3633.Earliest Finish Time for Land and Water Rides I/README_EN.md

@@ -126,32 +126,129 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/3600-3699/3633.Ea
 
 <!-- solution:start -->
 
-### Solution 1
+### Solution 1: Enumeration + Greedy
+
+We can consider two orders of rides: first land rides then water rides, or first water rides then land rides.
+
+For each order, we first calculate the earliest end time $\textit{minEnd}$ of the first type of ride, then enumerate the second type of ride and calculate the earliest end time of the second type of ride as $\max(\textit{minEnd}, \textit{startTime}) + \textit{duration}$, where $\textit{startTime}$ is the start time of the second type of ride. We take the minimum value among all possible earliest end times as the answer.
+
+Finally, we return the minimum value between the answers of the two orders.
+
+The time complexity is $O(n + m)$, where $n$ and $m$ are the numbers of land rides and water rides respectively. The space complexity is $O(1)$.
 
 <!-- tabs:start -->
 
 #### Python3
 
 ```python
-
+class Solution:
+    def earliestFinishTime(self, landStartTime: List[int], landDuration: List[int], waterStartTime: List[int], waterDuration: List[int]) -> int:
+        def calc(a1, t1, a2, t2):
+            min_end = min(a + t for a, t in zip(a1, t1))
+            return min(max(a, min_end) + t for a, t in zip(a2, t2))
+
+        x = calc(landStartTime, landDuration, waterStartTime, waterDuration)
+        y = calc(waterStartTime, waterDuration, landStartTime, landDuration)
+        return min(x, y)
 ```
 
 #### Java
 
 ```java
-
+class Solution {
+    public int earliestFinishTime(
+        int[] landStartTime, int[] landDuration, int[] waterStartTime, int[] waterDuration) {
+        int x = calc(landStartTime, landDuration, waterStartTime, waterDuration);
+        int y = calc(waterStartTime, waterDuration, landStartTime, landDuration);
+        return Math.min(x, y);
+    }
+
+    private int calc(int[] a1, int[] t1, int[] a2, int[] t2) {
+        int minEnd = Integer.MAX_VALUE;
+        for (int i = 0; i < a1.length; ++i) {
+            minEnd = Math.min(minEnd, a1[i] + t1[i]);
+        }
+        int ans = Integer.MAX_VALUE;
+        for (int i = 0; i < a2.length; ++i) {
+            ans = Math.min(ans, Math.max(minEnd, a2[i]) + t2[i]);
+        }
+        return ans;
+    }
+}
 ```
 
 #### C++
 
 ```cpp
-
+class Solution {
+public:
+    int earliestFinishTime(vector<int>& landStartTime, vector<int>& landDuration, vector<int>& waterStartTime, vector<int>& waterDuration) {
+        int x = calc(landStartTime, landDuration, waterStartTime, waterDuration);
+        int y = calc(waterStartTime, waterDuration, landStartTime, landDuration);
+        return min(x, y);
+    }
+
+    int calc(vector<int>& a1, vector<int>& t1, vector<int>& a2, vector<int>& t2) {
+        int minEnd = INT_MAX;
+        for (int i = 0; i < a1.size(); ++i) {
+            minEnd = min(minEnd, a1[i] + t1[i]);
+        }
+        int ans = INT_MAX;
+        for (int i = 0; i < a2.size(); ++i) {
+            ans = min(ans, max(minEnd, a2[i]) + t2[i]);
+        }
+        return ans;
+    }
+};
 ```
 
 #### Go
 
 ```go
+func earliestFinishTime(landStartTime []int, landDuration []int, waterStartTime []int, waterDuration []int) int {
+	x := calc(landStartTime, landDuration, waterStartTime, waterDuration)
+	y := calc(waterStartTime, waterDuration, landStartTime, landDuration)
+	return min(x, y)
+}
+
+func calc(a1 []int, t1 []int, a2 []int, t2 []int) int {
+	minEnd := math.MaxInt32
+	for i := 0; i < len(a1); i++ {
+		minEnd = min(minEnd, a1[i]+t1[i])
+	}
+	ans := math.MaxInt32
+	for i := 0; i < len(a2); i++ {
+		ans = min(ans, max(minEnd, a2[i])+t2[i])
+	}
+	return ans
+}
+```
 
+#### TypeScript
+
+```ts
+function earliestFinishTime(
+    landStartTime: number[],
+    landDuration: number[],
+    waterStartTime: number[],
+    waterDuration: number[],
+): number {
+    const x = calc(landStartTime, landDuration, waterStartTime, waterDuration);
+    const y = calc(waterStartTime, waterDuration, landStartTime, landDuration);
+    return Math.min(x, y);
+}
+
+function calc(a1: number[], t1: number[], a2: number[], t2: number[]): number {
+    let minEnd = Number.MAX_SAFE_INTEGER;
+    for (let i = 0; i < a1.length; i++) {
+        minEnd = Math.min(minEnd, a1[i] + t1[i]);
+    }
+    let ans = Number.MAX_SAFE_INTEGER;
+    for (let i = 0; i < a2.length; i++) {
+        ans = Math.min(ans, Math.max(minEnd, a2[i]) + t2[i]);
+    }
+    return ans;
+}
 ```
 
 <!-- tabs:end -->

solution/3600-3699/3633.Earliest Finish Time for Land and Water Rides I/Solution.cpp

@@ -0,0 +1,20 @@
+class Solution {
+public:
+    int earliestFinishTime(vector<int>& landStartTime, vector<int>& landDuration, vector<int>& waterStartTime, vector<int>& waterDuration) {
+        int x = calc(landStartTime, landDuration, waterStartTime, waterDuration);
+        int y = calc(waterStartTime, waterDuration, landStartTime, landDuration);
+        return min(x, y);
+    }
+
+    int calc(vector<int>& a1, vector<int>& t1, vector<int>& a2, vector<int>& t2) {
+        int minEnd = INT_MAX;
+        for (int i = 0; i < a1.size(); ++i) {
+            minEnd = min(minEnd, a1[i] + t1[i]);
+        }
+        int ans = INT_MAX;
+        for (int i = 0; i < a2.size(); ++i) {
+            ans = min(ans, max(minEnd, a2[i]) + t2[i]);
+        }
+        return ans;
+    }
+};

solution/3600-3699/3633.Earliest Finish Time for Land and Water Rides I/Solution.go

@@ -0,0 +1,17 @@
+func earliestFinishTime(landStartTime []int, landDuration []int, waterStartTime []int, waterDuration []int) int {
+	x := calc(landStartTime, landDuration, waterStartTime, waterDuration)
+	y := calc(waterStartTime, waterDuration, landStartTime, landDuration)
+	return min(x, y)
+}
+
+func calc(a1 []int, t1 []int, a2 []int, t2 []int) int {
+	minEnd := math.MaxInt32
+	for i := 0; i < len(a1); i++ {
+		minEnd = min(minEnd, a1[i]+t1[i])
+	}
+	ans := math.MaxInt32
+	for i := 0; i < len(a2); i++ {
+		ans = min(ans, max(minEnd, a2[i])+t2[i])
+	}
+	return ans
+}

solution/3600-3699/3633.Earliest Finish Time for Land and Water Rides I/Solution.java

@@ -0,0 +1,20 @@
+class Solution {
+    public int earliestFinishTime(
+        int[] landStartTime, int[] landDuration, int[] waterStartTime, int[] waterDuration) {
+        int x = calc(landStartTime, landDuration, waterStartTime, waterDuration);
+        int y = calc(waterStartTime, waterDuration, landStartTime, landDuration);
+        return Math.min(x, y);
+    }
+
+    private int calc(int[] a1, int[] t1, int[] a2, int[] t2) {
+        int minEnd = Integer.MAX_VALUE;
+        for (int i = 0; i < a1.length; ++i) {
+            minEnd = Math.min(minEnd, a1[i] + t1[i]);
+        }
+        int ans = Integer.MAX_VALUE;
+        for (int i = 0; i < a2.length; ++i) {
+            ans = Math.min(ans, Math.max(minEnd, a2[i]) + t2[i]);
+        }
+        return ans;
+    }
+}

solution/3600-3699/3633.Earliest Finish Time for Land and Water Rides I/Solution.py

@@ -0,0 +1,15 @@
+class Solution:
+    def earliestFinishTime(
+        self,
+        landStartTime: List[int],
+        landDuration: List[int],
+        waterStartTime: List[int],
+        waterDuration: List[int],
+    ) -> int:
+        def calc(a1, t1, a2, t2):
+            min_end = min(a + t for a, t in zip(a1, t1))
+            return min(max(a, min_end) + t for a, t in zip(a2, t2))
+
+        x = calc(landStartTime, landDuration, waterStartTime, waterDuration)
+        y = calc(waterStartTime, waterDuration, landStartTime, landDuration)
+        return min(x, y)

solution/3600-3699/3633.Earliest Finish Time for Land and Water Rides I/Solution.ts

@@ -0,0 +1,22 @@
+function earliestFinishTime(
+    landStartTime: number[],
+    landDuration: number[],
+    waterStartTime: number[],
+    waterDuration: number[],
+): number {
+    const x = calc(landStartTime, landDuration, waterStartTime, waterDuration);
+    const y = calc(waterStartTime, waterDuration, landStartTime, landDuration);
+    return Math.min(x, y);
+}
+
+function calc(a1: number[], t1: number[], a2: number[], t2: number[]): number {
+    let minEnd = Number.MAX_SAFE_INTEGER;
+    for (let i = 0; i < a1.length; i++) {
+        minEnd = Math.min(minEnd, a1[i] + t1[i]);
+    }
+    let ans = Number.MAX_SAFE_INTEGER;
+    for (let i = 0; i < a2.length; i++) {
+        ans = Math.min(ans, Math.max(minEnd, a2[i]) + t2[i]);
+    }
+    return ans;
+}