update: 添加问题“3494.酿造药水需要的最少总时间”的代码和题解 (#1165)

LetMeFly666 · web-flow · commit f23c3248f972 · 2025-10-09T23:52:49.000+08:00
* 3494: WA.cpp (#1164) * 3494: AC.cpp (#1164) - AC,83.33%,50.00% 待会儿hello for initing codes * 3494: WA.cpp (#1164) - failed optimization * 3494: AC.cpp (#1164) - AC,reverse,83.33%,64.28% * 3494: TLE.py (#1164) - what??? * 3494: AC.py (#1164) - AC,14209ms击败5.77%,76.92% 把len(skill)提前用变量n存起来就过了。。。 看评论官解也TLE： https://leetcode.cn/problems/find-the-minimum-amount-of-time-to-brew-potions/solutions/3800529/niang-zao-yao-shui-xu-yao-de-zui-shao-zo-ojii/comments/3139053/ * 3494: AC.rust (#1164) - AC,86ms击败100.00%,2.24MB击败100.00% 好小的内存占用好短的时间消耗 * 3494: AC.go (#1164) - AC,75.00%,100.00% * 3494: AC.java (#1164) - AC,11.76%,41.18% * update: 添加问题“3494.酿造药水需要的最少总时间”的代码和题解 (#1165) Signed-off-by: LetMeFly666 <814114971@qq.com> --------- Signed-off-by: LetMeFly666 <814114971@qq.com>
diff --git a/Codes/3494-find-the-minimum-amount-of-time-to-brew-potions.cpp b/Codes/3494-find-the-minimum-amount-of-time-to-brew-potions.cpp
@@ -0,0 +1,55 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-10-09 22:19:32
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-10-09 22:49:27
+ */
+#if defined(_WIN32) || defined(__APPLE__)
+#include "_[1,2]toVector.h"
+#endif
+
+typedef long long ll;
+class Solution {
+public:
+    ll minTime(vector<int>& skill, vector<int>& mana) {
+        vector<ll> times(skill.size());
+        for (int m : mana) {
+            ll delay = 0;
+            ll nowFinish = times[0] + skill[0] * m;
+            for (int i = 1; i < skill.size(); i++) {
+                delay += max(0ll, times[i] - nowFinish);
+                nowFinish = max(nowFinish, times[i]) + skill[i] * m;
+            }
+            times[0] += delay + skill[0] * m;
+            for (int i = 1; i < skill.size(); i++) {
+                times[i] = times[i - 1] + skill[i] * m;
+            }
+            // cout << times[0] << endl;  // *****
+        }
+        return times.back();
+    }
+};
+
+#if defined(_WIN32) || defined(__APPLE__)
+/*
+[1,5,2,4]
+[5,1,4,2]
+
+110
+
+巫师0完成时间：
+5
+53
+58
+88
+*/
+int main() {
+    string a, b;
+    while (cin >> a >> b) {
+        vector<int> va = stringToVector(a), vb = stringToVector(b);
+        Solution sol;
+        cout << sol.minTime(va, vb) << endl;
+    }
+    return 0;
+}
+#endif
diff --git a/Codes/3494-find-the-minimum-amount-of-time-to-brew-potions.go b/Codes/3494-find-the-minimum-amount-of-time-to-brew-potions.go
@@ -0,0 +1,30 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-10-09 22:52:05
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-10-09 23:32:19
+ */
+package main
+
+func minTime(skill []int, mana []int) int64 {
+    n := len(skill)
+    times := make([]int64, n)
+    for _, m := range mana {
+        lastTime := times[0] + int64(skill[0] * m)
+        for i := 1; i < n; i++ {
+            lastTime = max3494(times[i], lastTime) + int64(skill[i] * m)
+        }
+        times[n-1] = lastTime
+        for i := n - 2; i >= 0; i-- {
+            times[i] = times[i + 1] - int64(skill[i + 1] * m)
+        }
+    }
+    return times[n-1]
+}
+
+func max3494(a, b int64) int64 {
+    if a > b {
+        return a
+    }
+    return b
+}
diff --git a/Codes/3494-find-the-minimum-amount-of-time-to-brew-potions.java b/Codes/3494-find-the-minimum-amount-of-time-to-brew-potions.java
@@ -0,0 +1,23 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-10-09 22:52:05
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-10-09 23:34:16
+ */
+class Solution {
+    public long minTime(int[] skill, int[] mana) {
+        int n = skill.length;
+        long[] times = new long[n];
+        for (int m : mana) {
+            long last = times[0] + skill[0] * m;
+            for (int i = 1; i < n; i++) {
+                last = Math.max(last, times[i]) + skill[i] * m;
+            }
+            times[n-1] = last;
+            for (int i = n - 2; i >= 0; i--) {
+                times[i] = times[i + 1] - skill[i + 1] * m;
+            }
+        }
+        return times[n-1];
+    }
+}
diff --git a/Codes/3494-find-the-minimum-amount-of-time-to-brew-potions.py b/Codes/3494-find-the-minimum-amount-of-time-to-brew-potions.py
@@ -0,0 +1,20 @@
+'''
+Author: LetMeFly
+Date: 2025-10-09 22:52:05
+LastEditors: LetMeFly.xyz
+LastEditTime: 2025-10-09 23:11:26
+'''
+from typing import List
+
+class Solution:
+    def minTime(self, skill: List[int], mana: List[int]) -> int:
+        n = len(skill)
+        times = [0] * n
+        for m in mana:
+            lastTime = times[0] + skill[0] * m
+            for i in range(1, n):
+                lastTime = max(lastTime, times[i]) + skill[i] * m
+            times[-1] = lastTime
+            for i in range(n - 2, -1, -1):
+                times[i] = times[i + 1] - skill[i + 1] * m
+        return times[-1]
diff --git a/Codes/3494-find-the-minimum-amount-of-time-to-brew-potions.rs b/Codes/3494-find-the-minimum-amount-of-time-to-brew-potions.rs
@@ -0,0 +1,23 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-10-09 22:52:05
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-10-09 23:18:22
+ */
+impl Solution {
+    pub fn min_time(skill: Vec<i32>, mana: Vec<i32>) -> i64 {
+        let n: usize = skill.len();
+        let mut times: Vec<i64> = vec![0; n];
+        for m in mana {
+            let mut last_time: i64 = times[0] + (skill[0] * m) as i64;
+            for i in 1..n {
+                last_time = last_time.max(times[i]) + (skill[i] * m) as i64;
+            }
+            times[n-1] = last_time;
+            for i in (0..n-1).rev() {
+                times[i] = times[i + 1] - (skill[i + 1] * m) as i64;
+            }
+        }
+        times[n-1]
+    }
+}
diff --git a/Codes/3494-find-the-minimum-amount-of-time-to-brew-potions_usingBackForward.cpp b/Codes/3494-find-the-minimum-amount-of-time-to-brew-potions_usingBackForward.cpp
@@ -0,0 +1,28 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-10-09 22:19:32
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-10-09 23:01:17
+ */
+#if defined(_WIN32) || defined(__APPLE__)
+#include "_[1,2]toVector.h"
+#endif
+
+typedef long long ll;
+class Solution {
+public:
+    ll minTime(vector<int>& skill, vector<int>& mana) {
+        vector<ll> times(skill.size());
+        for (int m : mana) {
+            ll nowFinish = times[0] + skill[0] * m;
+            for (int i = 1; i < skill.size(); i++) {
+                nowFinish = max(nowFinish, times[i]) + skill[i] * m;
+            }
+            times.back() = nowFinish;
+            for (int i = skill.size() - 2; i >= 0; i--) {
+                times[i] = times[i + 1] - skill[i + 1] * m;
+            }
+        }
+        return times.back();
+    }
+};
diff --git a/Codes/lib.rs b/Codes/lib.rs
@@ -2,7 +2,7 @@
  * @Author: LetMeFly
  * @Date: 2025-08-07 14:11:36
  * @LastEditors: LetMeFly.xyz
- * @LastEditTime: 2025-10-01 20:40:27
+ * @LastEditTime: 2025-10-09 23:13:33
  */
 pub struct Solution;
-include!("0778-swim-in-rising-water.rs");  // 这个fileName是会被脚本替换掉的
+include!("3494-find-the-minimum-amount-of-time-to-brew-potions.rs");  // 这个fileName是会被脚本替换掉的
diff --git a/README.md b/README.md
@@ -1033,6 +1033,7 @@
 |3439.重新安排会议得到最多空余时间I|中等|<a href="https://leetcode.cn/problems/reschedule-meetings-for-maximum-free-time-i/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/07/13/LeetCode%203439.%E9%87%8D%E6%96%B0%E5%AE%89%E6%8E%92%E4%BC%9A%E8%AE%AE%E5%BE%97%E5%88%B0%E6%9C%80%E5%A4%9A%E7%A9%BA%E4%BD%99%E6%97%B6%E9%97%B4I/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/149317430" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/reschedule-meetings-for-maximum-free-time-i/solutions/3722937/letmefly-3439zhong-xin-an-pai-hui-yi-de-r3t9e/" target="_blank">LeetCode题解</a>|
 |3442.奇偶频次间的最大差值I|简单|<a href="https://leetcode.cn/problems/maximum-difference-between-even-and-odd-frequency-i/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/06/10/LeetCode%203442.%E5%A5%87%E5%81%B6%E9%A2%91%E6%AC%A1%E9%97%B4%E7%9A%84%E6%9C%80%E5%A4%A7%E5%B7%AE%E5%80%BCI/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/148570777" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/maximum-difference-between-even-and-odd-frequency-i/solutions/3697605/letmefly-3442qi-ou-pin-ci-jian-de-zui-da-nwwx/" target="_blank">LeetCode题解</a>|
 |3459.最长V形对角线段的长度|困难|<a href="https://leetcode.cn/problems/length-of-longest-v-shaped-diagonal-segment/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/08/31/LeetCode%203459.%E6%9C%80%E9%95%BFV%E5%BD%A2%E5%AF%B9%E8%A7%92%E7%BA%BF%E6%AE%B5%E7%9A%84%E9%95%BF%E5%BA%A6/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/151050078" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/length-of-longest-v-shaped-diagonal-segment/solutions/3768545/letmefly-3459zui-chang-v-xing-dui-jiao-x-gu8q/" target="_blank">LeetCode题解</a>|
+|3494.酿造药水需要的最少总时间|中等|<a href="https://leetcode.cn/problems/find-the-minimum-amount-of-time-to-brew-potions/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/10/09/LeetCode%203494.%E9%85%BF%E9%80%A0%E8%8D%AF%E6%B0%B4%E9%9C%80%E8%A6%81%E7%9A%84%E6%9C%80%E5%B0%91%E6%80%BB%E6%97%B6%E9%97%B4/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/152847907" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/find-the-minimum-amount-of-time-to-brew-potions/solutions/3801656/letmefly-3494niang-zao-yao-shui-xu-yao-d-bjxv/" target="_blank">LeetCode题解</a>|
 |3508.设计路由器|中等|<a href="https://leetcode.cn/problems/implement-router/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/09/20/LeetCode%203508.%E8%AE%BE%E8%AE%A1%E8%B7%AF%E7%94%B1%E5%99%A8/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/151901838" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/implement-router/solutions/3787451/letmefly-3508she-ji-lu-you-qi-stltao-stl-ehkf/" target="_blank">LeetCode题解</a>|
 |3516.找到最近的人|简单|<a href="https://leetcode.cn/problems/find-closest-person/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/09/04/LeetCode%203516.%E6%89%BE%E5%88%B0%E6%9C%80%E8%BF%91%E7%9A%84%E4%BA%BA/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/151184074" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/find-closest-person/solutions/3772009/letmefly-3516zhao-dao-zui-jin-de-ren-ji-8rlbz/" target="_blank">LeetCode题解</a>|
 |3541.找到频率最高的元音和辅音|简单|<a href="https://leetcode.cn/problems/find-most-frequent-vowel-and-consonant/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/09/13/LeetCode%203541.%E6%89%BE%E5%88%B0%E9%A2%91%E7%8E%87%E6%9C%80%E9%AB%98%E7%9A%84%E5%85%83%E9%9F%B3%E5%92%8C%E8%BE%85%E9%9F%B3/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/151653999" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/find-most-frequent-vowel-and-consonant/solutions/3780744/letmefly-3541zhao-dao-pin-lu-zui-gao-de-yv5vs/" target="_blank">LeetCode题解</a>|
diff --git a/Solutions/LeetCode 3494.酿造药水需要的最少总时间.md b/Solutions/LeetCode 3494.酿造药水需要的最少总时间.md
diff --git a/Solutions/Other-English-LearningNotes-SomeWords.md b/Solutions/Other-English-LearningNotes-SomeWords.md
diff --git a/Solutions/Other-Japanese-LearningNotes.md b/Solutions/Other-Japanese-LearningNotes.md
