update: 添加问题“3296.移山所需的最少秒数”的代码和题解 (#1440)

LetMeFly666 · web-flow · commit 949ac6fdf597 · 2026-03-13T23:19:01.000+08:00
* word: en 2026.3.9 * word: en 2026.3.10 * word: en 2026.3.12 * 3296: WA.cpp (#1439) * 3296: RE.cpp (#1439) * 3296: AC.cpp (#1439) - AC,29.22%,19.01% * update: 添加问题“3296.移山所需的最少秒数”的代码和题解 (#1440) Signed-off-by: LetMeFly666 <Tisfy@qq.com> --------- Signed-off-by: LetMeFly666 <Tisfy@qq.com>
diff --git a/Codes/3296-minimum-number-of-seconds-to-make-mountain-height-zero.cpp b/Codes/3296-minimum-number-of-seconds-to-make-mountain-height-zero.cpp
@@ -0,0 +1,28 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2026-03-13 22:49:36
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2026-03-13 22:57:56
+ */
+#ifdef _DEBUG
+#include "_[1,2]toVector.h"
+#endif
+
+typedef long long ll;
+class Solution {
+public:
+    ll minNumberOfSeconds(int mountainHeight, vector<int>& workerTimes) {
+        priority_queue<tuple<ll, ll, int>, vector<tuple<ll, ll, int>>, greater<>> pq;
+        for (int t : workerTimes) {
+            pq.push({t, 1, t});
+        }
+        ll ans = 0;
+        while (mountainHeight--) {
+            auto[now, times, once] = pq.top();
+            pq.pop();
+            ans = now;
+            pq.push({now + ++times * once, times, once});
+        }
+        return ans;
+    }
+};
diff --git a/README.md b/README.md
@@ -1079,6 +1079,7 @@
 |3280.将日期转换为二进制表示|简单|<a href="https://leetcode.cn/problems/convert-date-to-binary/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/01/01/LeetCode%203280.%E5%B0%86%E6%97%A5%E6%9C%9F%E8%BD%AC%E6%8D%A2%E4%B8%BA%E4%BA%8C%E8%BF%9B%E5%88%B6%E8%A1%A8%E7%A4%BA/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/144870892" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/convert-date-to-binary/solutions/3036032/letmefly-3280jiang-ri-qi-zhuan-huan-wei-149mv/" target="_blank">LeetCode题解</a>|
 |3285.找到稳定山的下标|简单|<a href="https://leetcode.cn/problems/find-indices-of-stable-mountains/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/12/19/LeetCode%203285.%E6%89%BE%E5%88%B0%E7%A8%B3%E5%AE%9A%E5%B1%B1%E7%9A%84%E4%B8%8B%E6%A0%87/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/144596618" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/find-indices-of-stable-mountains/solutions/3025068/letmefly-3285zhao-dao-wen-ding-shan-de-x-u3wc/" target="_blank">LeetCode题解</a>|
 |3289.数字小镇中的捣蛋鬼|简单|<a href="https://leetcode.cn/problems/the-two-sneaky-numbers-of-digitville/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/10/31/LeetCode%203289.%E6%95%B0%E5%AD%97%E5%B0%8F%E9%95%87%E4%B8%AD%E7%9A%84%E6%8D%A3%E8%9B%8B%E9%AC%BC/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/154214125" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/the-two-sneaky-numbers-of-digitville/solutions/3820570/letmefly-3289shu-zi-xiao-zhen-zhong-de-d-oz9r/" target="_blank">LeetCode题解</a>|
+|3296.移山所需的最少秒数|中等|<a href="https://leetcode.cn/problems/minimum-number-of-seconds-to-make-mountain-height-zero/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2026/03/13/LeetCode%203296.%E7%A7%BB%E5%B1%B1%E6%89%80%E9%9C%80%E7%9A%84%E6%9C%80%E5%B0%91%E7%A7%92%E6%95%B0/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/159020023" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/minimum-number-of-seconds-to-make-mountain-height-zero/solutions/3924553/letmefly-3296yi-shan-suo-xu-de-zui-shao-jbmgy/" target="_blank">LeetCode题解</a>|
 |3297.统计重新排列后包含另一个字符串的子字符串数目I|中等|<a href="https://leetcode.cn/problems/count-substrings-that-can-be-rearranged-to-contain-a-string-i/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/01/09/LeetCode%203297.%E7%BB%9F%E8%AE%A1%E9%87%8D%E6%96%B0%E6%8E%92%E5%88%97%E5%90%8E%E5%8C%85%E5%90%AB%E5%8F%A6%E4%B8%80%E4%B8%AA%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2%E6%95%B0%E7%9B%AEI/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/145031494" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/count-substrings-that-can-be-rearranged-to-contain-a-string-i/solutions/3042787/letmefly-3297tong-ji-zhong-xin-pai-lie-h-8ele/" target="_blank">LeetCode题解</a>|
 |3305.元音辅音字符串计数I|中等|<a href="https://leetcode.cn/problems/count-of-substrings-containing-every-vowel-and-k-consonants-i/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/03/12/LeetCode%203305.%E5%85%83%E9%9F%B3%E8%BE%85%E9%9F%B3%E5%AD%97%E7%AC%A6%E4%B8%B2%E8%AE%A1%E6%95%B0I/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/146197747" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/count-of-substrings-containing-every-vowel-and-k-consonants-i/solutions/3607571/letmefly-3305yuan-yin-fu-yin-zi-fu-chuan-ptkg/" target="_blank">LeetCode题解</a>|
 |3306.元音辅音字符串计数II|中等|<a href="https://leetcode.cn/problems/count-of-substrings-containing-every-vowel-and-k-consonants-ii/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/03/13/LeetCode%203306.%E5%85%83%E9%9F%B3%E8%BE%85%E9%9F%B3%E5%AD%97%E7%AC%A6%E4%B8%B2%E8%AE%A1%E6%95%B0II/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/146228751" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/count-of-substrings-containing-every-vowel-and-k-consonants-ii/solutions/3609545/letmefly-3306yuan-yin-fu-yin-zi-fu-chuan-7y2q/" target="_blank">LeetCode题解</a>|
diff --git a/Solutions/LeetCode 3296.移山所需的最少秒数.md b/Solutions/LeetCode 3296.移山所需的最少秒数.md
@@ -0,0 +1,134 @@
+---
+title: 3296.移山所需的最少秒数：优先队列
+date: 2026-03-13 22:59:06
+tags: [题解, LeetCode, 中等, 贪心, 数组, 数学, 二分查找, 堆（优先队列）, 优先队列]
+categories: [题解, LeetCode]
+---
+
+# 【LetMeFly】3296.移山所需的最少秒数：优先队列
+
+力扣题目链接：[https://leetcode.cn/problems/minimum-number-of-seconds-to-make-mountain-height-zero/](https://leetcode.cn/problems/minimum-number-of-seconds-to-make-mountain-height-zero/)
+
+<p>给你一个整数 <code>mountainHeight</code> 表示山的高度。</p>
+
+<p>同时给你一个整数数组 <code>workerTimes</code>，表示工人们的工作时间（单位：<strong>秒</strong>）。</p>
+
+<p>工人们需要 <strong>同时 </strong>进行工作以 <strong>降低 </strong>山的高度。对于工人 <code>i</code> :</p>
+
+<ul>
+	<li>山的高度降低 <code>x</code>，需要花费 <code>workerTimes[i] + workerTimes[i] * 2 + ... + workerTimes[i] * x</code> 秒。例如：
+
+	<ul>
+		<li>山的高度降低 1，需要 <code>workerTimes[i]</code> 秒。</li>
+		<li>山的高度降低 2，需要 <code>workerTimes[i] + workerTimes[i] * 2</code> 秒，依此类推。</li>
+	</ul>
+	</li>
+</ul>
+
+<p>返回一个整数，表示工人们使山的高度降低到 0 所需的 <strong>最少</strong> 秒数。</p>
+
+<p>&nbsp;</p>
+
+<p><strong class="example">示例 1：</strong></p>
+
+<div class="example-block">
+<p><strong>输入：</strong> <span class="example-io">mountainHeight = 4, workerTimes = [2,1,1]</span></p>
+
+<p><strong>输出：</strong> <span class="example-io">3</span></p>
+
+<p><strong>解释：</strong></p>
+
+<p>将山的高度降低到 0 的一种方式是：</p>
+
+<ul>
+	<li>工人 0 将高度降低 1，花费 <code>workerTimes[0] = 2</code> 秒。</li>
+	<li>工人 1 将高度降低 2，花费 <code>workerTimes[1] + workerTimes[1] * 2 = 3</code> 秒。</li>
+	<li>工人 2 将高度降低 1，花费 <code>workerTimes[2] = 1</code> 秒。</li>
+</ul>
+
+<p>因为工人同时工作，所需的最少时间为 <code>max(2, 3, 1) = 3</code> 秒。</p>
+</div>
+
+<p><strong class="example">示例 2：</strong></p>
+
+<div class="example-block">
+<p><strong>输入：</strong> <span class="example-io">mountainHeight = 10, workerTimes = [3,2,2,4]</span></p>
+
+<p><strong>输出：</strong> <span class="example-io">12</span></p>
+
+<p><strong>解释：</strong></p>
+
+<ul>
+	<li>工人 0 将高度降低 2，花费 <code>workerTimes[0] + workerTimes[0] * 2 = 9</code> 秒。</li>
+	<li>工人 1 将高度降低 3，花费 <code>workerTimes[1] + workerTimes[1] * 2 + workerTimes[1] * 3 = 12</code> 秒。</li>
+	<li>工人 2 将高度降低 3，花费 <code>workerTimes[2] + workerTimes[2] * 2 + workerTimes[2] * 3 = 12</code> 秒。</li>
+	<li>工人 3 将高度降低 2，花费 <code>workerTimes[3] + workerTimes[3] * 2 = 12</code> 秒。</li>
+</ul>
+
+<p>所需的最少时间为 <code>max(9, 12, 12, 12) = 12</code> 秒。</p>
+</div>
+
+<p><strong class="example">示例 3：</strong></p>
+
+<div class="example-block">
+<p><strong>输入：</strong> <span class="example-io">mountainHeight = 5, workerTimes = [1]</span></p>
+
+<p><strong>输出：</strong> <span class="example-io">15</span></p>
+
+<p><strong>解释：</strong></p>
+
+<p>这个示例中只有一个工人，所以答案是 <code>workerTimes[0] + workerTimes[0] * 2 + workerTimes[0] * 3 + workerTimes[0] * 4 + workerTimes[0] * 5 = 15</code> 秒。</p>
+</div>
+
+<p>&nbsp;</p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li><code>1 &lt;= mountainHeight &lt;= 10<sup>5</sup></code></li>
+	<li><code>1 &lt;= workerTimes.length &lt;= 10<sup>4</sup></code></li>
+	<li><code>1 &lt;= workerTimes[i] &lt;= 10<sup>6</sup></code></li>
+</ul>
+
+
+    
+## 解题方法：优先队列
+
+使用一个优先队列，每次选完工最早的工人降低1个山高。工人完工后可以再次进入队列，只不过再次进入队列后的下次工作耗时更久而已。
+
+具体来说，优先队列中存放每个工人的`(完工时间, 共计降低高度, baseTime)`，`共计降低高度`和`baseTime`都是为了计算完工时间。
+
++ 时间复杂度$O(height\times \log n)$
++ 空间复杂度$O(n)$
+
+### AC代码
+
+#### C++
+
+```cpp
+/*
+ * @LastEditTime: 2026-03-13 22:57:56
+ */
+typedef long long ll;
+class Solution {
+public:
+    ll minNumberOfSeconds(int mountainHeight, vector<int>& workerTimes) {
+        priority_queue<tuple<ll, ll, int>, vector<tuple<ll, ll, int>>, greater<>> pq;
+        for (int t : workerTimes) {
+            pq.push({t, 1, t});
+        }
+        ll ans = 0;
+        while (mountainHeight--) {
+            auto[now, times, once] = pq.top();
+            pq.pop();
+            ans = now;
+            pq.push({now + ++times * once, times, once});
+        }
+        return ans;
+    }
+};
+```
+
+> 同步发文于[CSDN](https://letmefly.blog.csdn.net/article/details/159020023)和我的[个人博客](https://blog.letmefly.xyz/)，原创不易，转载经作者同意后请附上[原文链接](https://blog.letmefly.xyz/2026/03/13/LeetCode%203296.%E7%A7%BB%E5%B1%B1%E6%89%80%E9%9C%80%E7%9A%84%E6%9C%80%E5%B0%91%E7%A7%92%E6%95%B0/)哦~
+>
+> 千篇源码题解[已开源](https://github.com/LetMeFly666/LeetCode)
diff --git a/Solutions/Other-English-LearningNotes-SomeWords.md b/Solutions/Other-English-LearningNotes-SomeWords.md
@@ -1865,6 +1865,13 @@ categories: [自用]
 |mechanics|n. 力学，结构，技巧，机械学|
 |pretentious|adj. 炫耀的，虚夸的，自命不凡的|
 |indignant|adj. 愤慨的，愤怒的|
+|||
+|conceptive|adj. 概念上的，设想上的，〈罕〉会受孕的|
+|groundless|adj. 无理由的，无根据的|
+|||
+|wreath|n. (祭奠)花圈，(圣诞节)花环|
+|||
+|prohibitive|adj. (法令)禁止的，贵得买不起的|
 
 + 这个web要是能设计得可以闭眼(完全不睁眼)键盘控制背单词就好了。
 + 也许可以加个AI用最近词编故事功能(返回接口中支持标注所使用单词高亮?)
diff --git a/codestats.plugin.zsh b/codestats.plugin.zsh
@@ -0,0 +1,204 @@
+# https://gitlab.com/code-stats/code-stats-zsh
+
+_codestats_version="0.3.11"
+
+zmodload zsh/datetime
+
+declare -g -i _codestats_xp=0
+declare -g -i _codestats_pulse_time=${EPOCHSECONDS}
+
+# Because each `curl` call is forked into a subshell to keep the interactive
+# shell responsive, the consecutive error count cannot be updated in a
+# variable. So we use a temp file, one error per line.
+_codestats_consecutive_errors=$(mktemp)
+
+# Logging: write to file if CODESTATS_LOG_FILE is set and exists
+_codestats_log()
+{
+    if [[ -w "${CODESTATS_LOG_FILE}" ]]; then
+        # EPOCHSECONDS is an integer, so disable globbing/splitting warning
+        # shellcheck disable=SC2086
+        echo "$(\strftime %Y-%m-%dT%H:%M:%S ${EPOCHSECONDS}) ($$) $*" >> "${CODESTATS_LOG_FILE}"
+    fi
+}
+
+# Widget wrapper: add a keypress and call original widget
+_codestats_call_widget()
+{
+    # Bracketed-paste-magic calls self-insert when pasting and sets $PASTED.
+    # Don't add xp for pasting.
+
+    # shellcheck disable=SC2004
+    if (( ! ${+PASTED} )); then
+        _codestats_xp+=1
+    fi
+
+    builtin zle "$@"
+}
+
+# Rebind widgets
+_codestats_rebind_widgets()
+{
+    local w
+    for w in \
+        self-insert \
+        delete-char \
+        backward-delete-char \
+        accept-line
+    do
+        # call the internal version, ie. the one beginning with `.`
+        eval "_codestats_${w} () { _codestats_call_widget .${w} -- \"\$@\" }"
+        zle -N ${w} _codestats_${w}
+
+        _codestats_log "Wrapped and rebound the ${w} widget."
+    done
+}
+
+# Pulse sending function
+_codestats_send_pulse()
+{
+    # Check that error count hasn't been exceeded
+    local -i error_count=0
+    if [[ -r "${_codestats_consecutive_errors}" ]]; then
+        error_count=$(wc -l < "${_codestats_consecutive_errors}")
+    fi
+    if (( error_count > 4 )); then
+        _codestats_log "Received too many consecutive errors! Stopping..."
+        _codestats_stop "Received ${error_count} consecutive errors when trying to save XP."
+        return
+    fi
+
+    # If there's accumulated XP, send it
+    if (( _codestats_xp > 0 )); then
+        local url
+        url="$(_codestats_pulse_url)"
+
+        _codestats_log "Sending pulse (${_codestats_xp} xp) to ${url}"
+
+        local payload
+        payload=$(_codestats_payload ${_codestats_xp})
+
+        \curl \
+            --max-time 5 \
+            --header "Content-Type: application/json" \
+            --header "X-API-Token: ${CODESTATS_API_KEY}" \
+            --user-agent "code-stats-zsh/${_codestats_version}" \
+            --data "${payload}" \
+            --request POST \
+            --silent \
+            --output /dev/null \
+            --write-out "%{http_code}" \
+            "${url}" \
+            | _codestats_handle_response_status \
+            &|
+
+        _codestats_xp=0
+    fi
+}
+
+# Error handling based on HTTP status
+_codestats_handle_response_status()
+{
+    local _status
+    _status=$(\cat -)
+    case ${_status} in
+        000)
+            _codestats_log "Network error!"
+            # don't stop; maybe the network will start working eventually
+            ;;
+        200 | 201 )
+            _codestats_log "Success (${_status})!"
+            # clear error count
+            echo -n >! "${_codestats_consecutive_errors}"
+            ;;
+        3* )
+            _codestats_log "Unexpected redirect ${_status}!"
+            _codestats_stop "Server responded with a redirect. Perhaps code-stats-zsh is out of date?"
+            # this problem will probably not go away. stop immediately.
+            ;;
+        4* | 5* )
+            _codestats_log "Server responded with error ${_status}!"
+            # some of 4xx and 5xx statuses may indicate a temporary problem
+            echo "${_status}" >>! "${_codestats_consecutive_errors}"
+            ;;
+        *)
+            _codestats_log "Unexpected response status ${_status}!"
+            # whatever happened, stop if it persists
+            echo "${_status}" >>! "${_codestats_consecutive_errors}"
+            ;;
+    esac
+}
+
+_codestats_pulse_url()
+{
+    echo "${CODESTATS_API_URL:-https://codestats.net}/api/my/pulses"
+}
+
+# Create API payload
+_codestats_payload()
+{
+    # shellcheck disable=SC2086
+    cat <<EOF
+{
+    "coded_at": "$(\strftime %Y-%m-%dT%H:%M:%S%z ${EPOCHSECONDS})",
+    "xps": [{"language": "Terminal (Zsh)", "xp": $1}]
+}
+EOF
+}
+
+# Check time since last pulse; maybe send pulse
+_codestats_poll()
+{
+    if (( EPOCHSECONDS - _codestats_pulse_time > 10 )); then
+        _codestats_send_pulse
+        _codestats_pulse_time=${EPOCHSECONDS}
+    fi
+}
+
+_codestats_exit()
+{
+    _codestats_log "Shell is exiting. Calling _codestats_send_pulse one last time."
+    _codestats_send_pulse
+
+    # remove temp file
+    rm -f "${_codestats_consecutive_errors}"
+}
+
+_codestats_init()
+{
+    _codestats_log "Initializing code-stats-zsh@${_codestats_version}..."
+
+    _codestats_rebind_widgets
+
+    # Call the polling function on each new prompt
+    autoload -U add-zsh-hook
+    add-zsh-hook precmd _codestats_poll
+
+    # Send pulse on shell exit
+    add-zsh-hook zshexit _codestats_exit
+
+    _codestats_log "Initialization complete."
+}
+
+# Stop because there was an error. Overwrite handler functions.
+_codestats_stop()
+{
+    _codestats_log "Stopping zsh-code-stats. Overwriting hook functions with no-ops."
+    >&2 echo "code-stats-zsh: $* Stopping."
+    _codestats_poll() { true; }
+    _codestats_exit() { true; }
+
+    # remove temp file
+    rm -f "${_codestats_consecutive_errors}"
+}
+
+if [[ -n "${CODESTATS_API_KEY}" ]]; then
+    _codestats_init
+else
+    echo "code-stats-zsh requires CODESTATS_API_KEY to be set!"
+    false
+fi
+
+if [[ -n "${CODESTATS_LOG_FILE}" && ! -w "${CODESTATS_LOG_FILE}" ]]; then
+    echo "Warning: CODESTATS_LOG_FILE needs to exist and be writable!"
+fi
