update: 添加问题“778.水位上升的泳池中游泳”的代码和题解 (#1154)

0778(word): AC.cpp+py+java+rust+go(#1153)

cpp - AC,93.42%,92.11%
py - AC,98.13%,59.33%
java - AC,47.31%,97.31%
go - AC,45.61%,89.47%
rust - AC,38.46%,38.46%

本次更改中：
英语单词的背诵日期分别是：2025.10.3、10.4、10.5；
日语单词的背诵日期是2025.10.6。

修复《1290.二进制链表转整数：链表+进制转换》图地址
增加《1039.多边形三角剖分的最低得分：记忆化搜索（深度优先搜索）》封面图
增加《812.最大三角形面积：三角形面积公式考察（附三种公式）》封面图

Signed-off-by: LetMeFly666 <[email protected]>

Author: LetMeFly666

.commitmsg

@@ -1,7 +1,15 @@
-0976: AC.cpp+py+java+go+rust (#1149)
+0778(word): AC.cpp+py+java+rust+go(#1153)
 
-cpp - AC,58.29%,26.60%
-rust - AC,-%,100.00%
-java - AC,96.37%,99.05%
-go - AC,47.06%,100.00%
-py - AC,34.41%,25.76%
+cpp - AC,93.42%,92.11%
+py - AC,98.13%,59.33%
+java - AC,47.31%,97.31%
+go - AC,45.61%,89.47%
+rust - AC,38.46%,38.46%
+
+本次更改中：
+英语单词的背诵日期分别是：2025.10.3、10.4、10.5；
+日语单词的背诵日期是2025.10.6。
+
+修复《1290.二进制链表转整数：链表+进制转换》图地址
+增加《1039.多边形三角剖分的最低得分：记忆化搜索（深度优先搜索）》封面图
+增加《812.最大三角形面积：三角形面积公式考察（附三种公式）》封面图

Codes/0778-swim-in-rising-water.cpp

@@ -0,0 +1,44 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-10-06 12:17:42
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-10-06 12:31:27
+ */
+#if defined(_WIN32) || defined(__APPLE__)
+#include "_[1,2]toVector.h"
+#endif
+
+class Solution {
+private:
+    static constexpr int direction[4][2] = {{0, 1}, {0, -1}, {-1, 0}, {1, 0}};
+public:
+    int swimInWater(vector<vector<int>>& grid) {
+        int n = grid.size(), m = grid[0].size();
+        if (n == 1 && m == 1) {
+            return grid[0][0];  // while的判断逻辑是入队时判断是否是终点
+        }
+        auto cmp = [&grid](pair<int, int>& a, pair<int, int>& b) {
+            return grid[a.first][a.second] > grid[b.first][b.second];  // val小的优先
+        };
+        priority_queue<pair<int, int>, vector<pair<int, int>>, decltype(cmp)> pq(cmp);
+        vector<vector<bool>> visited(n, vector<bool>(m));
+        pq.push({0, 0});
+        visited[0][0] = true;
+        while (true) {
+            auto [x, y] = pq.top();
+            pq.pop();
+            for (int d = 0; d < 4; d++) {
+                int nx = x + direction[d][0], ny = y + direction[d][1];
+                if (nx < 0 || nx >= n || ny < 0 || ny >= m || visited[nx][ny]) {
+                    continue;
+                }
+                grid[nx][ny] = max(grid[nx][ny], grid[x][y]);
+                if (nx == n - 1 && ny == m - 1) {
+                    return grid[nx][ny];
+                }
+                visited[nx][ny] = true;
+                pq.push({nx, ny});
+            }
+        }
+    }
+};

Codes/0778-swim-in-rising-water.go

@@ -0,0 +1,60 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-10-06 12:17:42
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-10-06 14:31:25
+ */
+package main
+
+// The Wrong Version: should call heap.Pop(pq) but not pq.Pop()
+
+import "container/heap"
+
+type Item778 struct {
+    x, y int
+    val int
+}
+
+type PriorityQueue778 []*Item778
+
+var directions778 = [][]int{{0, 1}, {0, -1}, {-1, 0}, {1, 0}}
+
+func swimInWater(grid [][]int) int {
+    n, m := len(grid), len(grid[0])
+    if n == 1 && m == 1 {
+        return grid[0][0]
+    }
+    visited := make([][]bool, n)
+    for i, _ := range visited {
+        visited[i] = make([]bool, m)
+    }
+
+    pq := &PriorityQueue778{}
+    heap.Init(pq)
+    pq.Push(&Item778{0, 0, grid[0][0]})
+    visited[0][0] = true
+    for true {
+        item := pq.Pop().(*Item778)
+        x, y, val := item.x, item.y, item.val
+        for _, d := range directions778 {
+            nx, ny := x + d[0], y + d[1]
+            if nx < 0 || nx >= n || ny < 0 || ny >= m || visited[nx][ny] {
+                continue
+            }
+            grid[nx][ny] = max(grid[nx][ny], val)
+            if nx == n - 1 && ny == m - 1 {
+                return grid[nx][ny]
+            }
+            visited[nx][ny] = true
+            pq.Push(&Item778{nx, ny, grid[nx][ny]})
+        }
+    }
+
+    return -1  // Fake Return
+}
+
+func (pq PriorityQueue778) Len() int { return len(pq) }
+func (pq PriorityQueue778) Less(i, j int) bool { return pq[i].val < pq[j].val }
+func (pq PriorityQueue778) Swap(i, j int) { pq[i], pq[j] = pq[j], pq[i] }
+func (pq *PriorityQueue778) Push(x any) { *pq = append(*pq, x.(*Item778)) }
+func (pq *PriorityQueue778) Pop() any { n := len(*pq); item := (*pq)[n - 1]; *pq = (*pq)[:n-1]; return item }

Codes/0778-swim-in-rising-water.java

@@ -0,0 +1,38 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-10-06 12:17:42
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-10-06 14:04:24
+ */
+import java.util.PriorityQueue;
+
+class Solution {
+    private static final int[][] directions = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};
+
+    public int swimInWater(int[][] grid) {
+        int n = grid.length, m = grid[0].length;
+        if (n == 1 && m == 1) {
+            return grid[0][0];
+        }
+        boolean[][] visited = new boolean[n][m];
+        PriorityQueue<int[]> pq = new PriorityQueue<>((a, b) -> grid[a[0]][a[1]] - grid[b[0]][b[1]]);
+        pq.add(new int[]{0, 0});
+        visited[0][0] = true;
+        while (true) {
+            int[] top = pq.poll();
+            int x = top[0], y = top[1];
+            for (int[] d : directions) {
+                int nx = x + d[0], ny = y + d[1];
+                if (nx < 0 || nx >= n || ny < 0 || ny >= m || visited[nx][ny]) {
+                    continue;
+                }
+                grid[nx][ny] = Math.max(grid[nx][ny], grid[x][y]);
+                if (nx == n - 1 && ny == m - 1) {
+                    return grid[nx][ny];
+                }
+                visited[nx][ny] = true;
+                pq.add(new int[]{nx, ny});
+            }
+        }
+    }
+}

Codes/0778-swim-in-rising-water.py

@@ -0,0 +1,30 @@
+'''
+Author: LetMeFly
+Date: 2025-10-06 12:17:42
+LastEditors: LetMeFly.xyz
+LastEditTime: 2025-10-06 13:06:15
+'''
+from typing import List
+import heapq
+
+class Solution:
+    directions = [[0, 1], [0, -1], [-1, 0], [1, 0]]
+
+    def swimInWater(self, grid: List[List[int]]) -> int:
+        n, m = len(grid), len(grid[0])
+        if n == 1 and m == 1:
+            return grid[0][0]
+        visited = [[False] * m for _ in range(n)]
+        pq = [(grid[0][0], 0, 0)]
+        visited[0][0] = True
+        while True:
+            val, x, y = heapq.heappop(pq)
+            for dx, dy in self.directions:
+                nx, ny = x + dx, y + dy
+                if (not (0 <= nx < n and 0 <= ny < m)) or visited[nx][ny]:
+                    continue
+                grid[nx][ny] = max(grid[nx][ny], val)
+                if nx == n - 1 and ny == m - 1:
+                    return grid[nx][ny]
+                visited[nx][ny] = True
+                heapq.heappush(pq, (grid[nx][ny], nx, ny))

Codes/0778-swim-in-rising-water.rs

@@ -0,0 +1,41 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-10-06 12:17:42
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-10-06 14:48:19
+ */
+use std::collections::BinaryHeap;
+use std::cmp::Reverse;
+
+impl Solution {
+    const DIRECTIONS: [[i32; 2]; 4] = [[0, 1], [0, -1], [-1, 0], [1, 0]];
+    pub fn swim_in_water(grid: Vec<Vec<i32>>) -> i32 {
+        let n: usize = grid.len();
+        let m: usize = grid[0].len();
+        if n == 1 && m == 1 {
+            return grid[0][0];
+        }
+        let mut pq = BinaryHeap::new();
+        let mut visited: Vec<Vec<bool>> = vec![vec![false; m]; n];
+        pq.push(Reverse((grid[0][0], 0, 0)));
+        visited[0][0] = true;
+
+        while let Some(Reverse((val, x, y))) = pq.pop() {
+            for &[dx, dy] in Self::DIRECTIONS.iter() {
+                let nx: usize = x + dx as usize;
+                let ny: usize = y + dy as usize;
+                if nx < 0 || nx >= n || ny < 0 || ny >= m || visited[nx][ny] {
+                    continue;
+                }
+                let n_val: i32 = val.max(grid[nx][ny]);
+                if nx == n - 1 && ny == m - 1 {
+                    return n_val;
+                }
+                visited[nx][ny] = true;
+                pq.push(Reverse((n_val, nx, ny)));
+            }
+        }
+
+        -1  // Fake Return
+    }
+}

Codes/0778-swim-in-rising-water_TheTrueVersion.go

@@ -0,0 +1,58 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-10-06 12:17:42
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-10-06 14:31:37
+ */
+package main
+
+import "container/heap"
+
+type Item778 struct {
+    x, y int
+    val int
+}
+
+type PriorityQueue778 []*Item778
+
+var directions778 = [][]int{{0, 1}, {0, -1}, {-1, 0}, {1, 0}}
+
+func swimInWater(grid [][]int) int {
+    n, m := len(grid), len(grid[0])
+    if n == 1 && m == 1 {
+        return grid[0][0]
+    }
+    visited := make([][]bool, n)
+    for i, _ := range visited {
+        visited[i] = make([]bool, m)
+    }
+
+    pq := &PriorityQueue778{}
+    heap.Init(pq)
+    heap.Push(pq, &Item778{0, 0, grid[0][0]})
+    visited[0][0] = true
+    for true {
+        item := heap.Pop(pq).(*Item778)
+        x, y, val := item.x, item.y, item.val
+        for _, d := range directions778 {
+            nx, ny := x + d[0], y + d[1]
+            if nx < 0 || nx >= n || ny < 0 || ny >= m || visited[nx][ny] {
+                continue
+            }
+            grid[nx][ny] = max(grid[nx][ny], val)
+            if nx == n - 1 && ny == m - 1 {
+                return grid[nx][ny]
+            }
+            visited[nx][ny] = true
+            heap.Push(pq, &Item778{nx, ny, grid[nx][ny]})
+        }
+    }
+
+    return -1  // Fake Return
+}
+
+func (pq PriorityQueue778) Len() int { return len(pq) }
+func (pq PriorityQueue778) Less(i, j int) bool { return pq[i].val < pq[j].val }
+func (pq PriorityQueue778) Swap(i, j int) { pq[i], pq[j] = pq[j], pq[i] }
+func (pq *PriorityQueue778) Push(x any) { *pq = append(*pq, x.(*Item778)) }
+func (pq *PriorityQueue778) Pop() any { n := len(*pq); item := (*pq)[n - 1]; *pq = (*pq)[:n-1]; return item }

Codes/lib.rs

@@ -5,4 +5,4 @@
  * @LastEditTime: 2025-10-01 20:40:27
  */
 pub struct Solution;
-include!("0976-largest-perimeter-triangle.rs");  // 这个fileName是会被脚本替换掉的
+include!("0778-swim-in-rising-water.rs");  // 这个fileName是会被脚本替换掉的

README.md

@@ -397,6 +397,7 @@
 |0769.最多能完成排序的块|中等|<a href="https://leetcode.cn/problems/max-chunks-to-make-sorted/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2022/10/13/LeetCode%200769.%E6%9C%80%E5%A4%9A%E8%83%BD%E5%AE%8C%E6%88%90%E6%8E%92%E5%BA%8F%E7%9A%84%E5%9D%97/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/127295302" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/max-chunks-to-make-sorted/solution/letmefly-769zui-duo-neng-wan-cheng-pai-x-pzsz/" target="_blank">LeetCode题解</a>|
 |0771.宝石与石头|简单|<a href="https://leetcode.cn/problems/jewels-and-stones/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2023/07/24/LeetCode%200771.%E5%AE%9D%E7%9F%B3%E4%B8%8E%E7%9F%B3%E5%A4%B4/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/131888350" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/jewels-and-stones/solutions/2356279/letmefly-771bao-shi-yu-shi-tou-by-tisfy-fqmc/" target="_blank">LeetCode题解</a>|
 |0775.全局倒置与局部倒置|中等|<a href="https://leetcode.cn/problems/global-and-local-inversions/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2022/11/16/LeetCode%200775.%E5%85%A8%E5%B1%80%E5%80%92%E7%BD%AE%E4%B8%8E%E5%B1%80%E9%83%A8%E5%80%92%E7%BD%AE/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/127877435" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/global-and-local-inversions/solutions/1973200/letmefly-775quan-ju-dao-zhi-yu-ju-bu-dao-zbqw/" target="_blank">LeetCode题解</a>|
+|0778.水位上升的泳池中游泳|困难|<a href="https://leetcode.cn/problems/swim-in-rising-water/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/10/06/LeetCode%200778.%E6%B0%B4%E4%BD%8D%E4%B8%8A%E5%8D%87%E7%9A%84%E6%B3%B3%E6%B1%A0%E4%B8%AD%E6%B8%B8%E6%B3%B3/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/152604318" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/swim-in-rising-water/solutions/3799229/778shui-wei-shang-sheng-de-yong-chi-zhon-j0la/" target="_blank">LeetCode题解</a>|
 |0779.第K个语法符号|中等|<a href="https://leetcode.cn/problems/k-th-symbol-in-grammar/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2022/10/20/LeetCode%200779.%E7%AC%ACK%E4%B8%AA%E8%AF%AD%E6%B3%95%E7%AC%A6%E5%8F%B7/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/127419515" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/k-th-symbol-in-grammar/solution/letmefly-779di-kge-yu-fa-fu-hao-di-gui-z-9fs1/" target="_blank">LeetCode题解</a>|
 |0781.森林中的兔子|中等|<a href="https://leetcode.cn/problems/rabbits-in-forest/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/04/20/LeetCode%200781.%E6%A3%AE%E6%9E%97%E4%B8%AD%E7%9A%84%E5%85%94%E5%AD%90/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/147375747" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/rabbits-in-forest/solutions/3657091/letmefly-781sen-lin-zhong-de-tu-zi-si-we-bs2h/" target="_blank">LeetCode题解</a>|
 |0784.字母大小写全排列|中等|<a href="https://leetcode.cn/problems/letter-case-permutation/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2022/10/30/LeetCode%200784.%E5%AD%97%E6%AF%8D%E5%A4%A7%E5%B0%8F%E5%86%99%E5%85%A8%E6%8E%92%E5%88%97/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/127595187" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/letter-case-permutation/solution/letmefly-784zi-mu-da-xiao-xie-quan-pai-l-5i9r/" target="_blank">LeetCode题解</a>|