add 1102

Author: luliyucoordinate

README.md

@@ -433,5 +433,7 @@ LeetCode
 |1096|[Brace Expansion II](https://leetcode.com/problems/brace-expansion-ii/) | c | [c++](./src/1096-Brace-Expansion-II/1096.cpp) |[python](./src/1096-Brace-Expansion-II/1096.py)|[go](./src/1096-Brace-Expansion-II/1096.go)||Hard|
 |1099|[Two Sum Less Than K](https://leetcode.com/contest/biweekly-contest-3/problems/two-sum-less-than-k/) | c | [c++](./src/1099-Two-Sum-Less-Than-K/1099.cpp) |[python](./src/1099-Two-Sum-Less-Than-K/1099.py)|[go](./src/1099-Two-Sum-Less-Than-K/1099.go)||Easy|
 |1100|[Find K-Length Substrings With No Repeated Characters](https://leetcode.com/contest/biweekly-contest-3/problems/find-k-length-substrings-with-no-repeated-characters/) | c | [c++](./src/1100-Find-K-Length-Substrings-With-No-Repeated-Characters/1100.cpp) |[python](./src/1100-Find-K-Length-Substrings-With-No-Repeated-Characters/1100.py)|[go](./src/1100-Find-K-Length-Substrings-With-No-Repeated-Characters/1100.go)||Easy|
+|1102|[Path With Maximum Minimum Value](https://leetcode.com/contest/biweekly-contest-3/problems/path-with-maximum-minimum-value/) | c | [c++](./src/1102-Path-With-Maximum-Minimum-Value/1102.cpp) |[python](./src/1102-Path-With-Maximum-Minimum-Value/1102.py)|[go](./src/1102-Path-With-Maximum-Minimum-Value/1102.go)||Medium|
 |1103|[Distribute Candies to People](https://leetcode.com/problems/distribute-candies-to-people/) | c | [c++](./src/1103-Distribute-Candies-to-People/1103.cpp) |[python](./src/1103-Distribute-Candies-to-People/1103.py)|[go](./src/1103-Distribute-Candies-to-People/1103.go)||Easy|
+|1104|[Path In Zigzag Labelled Binary Tree](https://leetcode.com/problems/path-in-zigzag-labelled-binary-tree/) | c | [c++](./src/1104-Path-In-Zigzag-Labelled-Binary-Tree/1104.cpp) |[python](./src/1104-Path-In-Zigzag-Labelled-Binary-Tree/1104.py)|[go](./src/1104-Path-In-Zigzag-Labelled-Binary-Tree/1104.go)||Easy|
 |1105|[Filling Bookcase Shelves](https://leetcode.com/problems/filling-bookcase-shelves/) | c | [c++](./src/1105-Filling-Bookcase-Shelves/1105.cpp) |[python](./src/1105-Filling-Bookcase-Shelves/1105.py)|[go](./src/1105-Filling-Bookcase-Shelves/1105.go)||Medium|

src/1102-Path-With-Maximum-Minimum-Value/1102.cpp

@@ -0,0 +1,29 @@
+class Solution 
+{
+public:
+    int maximumMinimumPath(vector<vector<int>>& A) 
+    {
+        int r = A.size(), c = A[0].size();
+        vector<vector<int>> vi(r, vector<int>(c, 0));
+        priority_queue<vector<int>> q;
+        q.push({A[0][0], 0, 0});
+        while (!q.empty())
+        {
+            auto it = q.top(); q.pop();
+            if (it[1] == r-1 and it[2] == c-1) return it[0];
+            for (auto& d : dire)
+            {
+                int nx = d[0] + it[1], ny = d[1] + it[2];
+                if (nx >= 0 and nx < r and ny >= 0 and ny < c
+                    and vi[nx][ny] == 0)
+                {
+                    vi[nx][ny] = 1;
+                    q.push({min(it[0], A[nx][ny]), nx, ny});
+                }
+            }
+        }
+        return 0;
+    }
+private:
+    int dire[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
+};

src/1102-Path-With-Maximum-Minimum-Value/1102.go

@@ -0,0 +1,64 @@
+import "container/heap"
+func min(a, b int) int {
+    if a < b {
+        return a
+    }
+    return b
+}
+
+type Item struct {
+    pre, x, y int
+}
+
+type Heap []*Item
+
+func (h Heap) Len() int { 
+    return len(h)
+}
+
+func (h Heap) Less(i, j int) bool {
+    return h[i].pre > h[j].pre
+}
+
+func (h Heap) Swap(i, j int) {
+    h[i], h[j] = h[j], h[i]
+}
+
+func (h *Heap) Pop() interface{} {
+    old := *h
+    n := len(old)
+    item := old[n - 1]
+    *h = old[0:n - 1]
+    return item
+}
+
+func (h *Heap) Push(x interface{}) {
+    *h = append(*h, x.(*Item))
+}
+
+func maximumMinimumPath(A [][]int) int {
+    r, c := len(A), len(A[0])
+    dire := [4][2]int{{1, 0}, {-1, 0}, {0, 1}, {0, -1}}
+    vi := make([][]int, r)
+    for i := 0; i < r; i++ {
+        vi[i] = make([]int, c)
+    }
+    vi[0][0] = 1
+    
+    q := &Heap{&Item{A[0][0], 0, 0}}
+    heap.Init(q)
+    for q.Len() > 0 {
+        it := heap.Pop(q).(*Item)
+        if it.x == r-1 && it.y == c-1 {
+            return it.pre
+        }
+        for _, v := range dire {
+            nx, ny := it.x + v[0], it.y + v[1]
+            if nx >= 0 && nx < r && ny >= 0 && ny < c && vi[nx][ny] == 0 {
+                vi[nx][ny] = 1
+                heap.Push(q, &Item{min(it.pre, A[nx][ny]), nx, ny})
+            } 
+        }
+    }
+    return 0
+}

src/1102-Path-With-Maximum-Minimum-Value/1102.py

@@ -0,0 +1,21 @@
+import heapq
+class Solution:
+    def maximumMinimumPath(self, A: List[List[int]]) -> int:
+        dire = [[1, 0], [-1, 0], [0, 1], [0, -1]]
+        r, c = len(A), len(A[0])
+        vi = {(0, 0)}
+        q = [[-A[0][0], 0, 0]]
+        heapq.heapify(q)
+        
+        while q:
+            pre, x, y = heapq.heappop(q)
+            if x == r-1 and y == c-1:
+                return -pre
+            
+            for i, j in dire:
+                nx, ny = i + x, j + y
+                if nx >= 0 and nx < r and ny >= 0 and ny < c and (nx, ny) not in vi:
+                    vi.add((nx, ny))
+                    heapq.heappush(q, [max(pre, -A[nx][ny]), nx, ny])
+
+        return 0