add 1765

fishercoder1534 · fishercoder1534 · commit 9b2d37fa7784 · 2021-02-20T08:45:35.000-08:00
diff --git a/README.md b/README.md
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ &#9733;
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1765|[Map of Highest Peak](https://leetcode.com/problems/map-of-highest-peak/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1765.java) ||Medium|BFS, Graph|
 |1764|[Form Array by Concatenating Subarrays of Another Array](https://leetcode.com/problems/form-array-by-concatenating-subarrays-of-another-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1764.java) ||Medium|Array, Greedy|
 |1763|[Longest Nice Substring](https://leetcode.com/problems/longest-nice-substring/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1763.java) ||Easy|String|
 |1759|[Count Number of Homogenous Substrings](https://leetcode.com/problems/count-number-of-homogenous-substrings/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1758.java) ||Medium|String ,Greedy|
diff --git a/src/main/java/com/fishercoder/solutions/_1765.java b/src/main/java/com/fishercoder/solutions/_1765.java
@@ -0,0 +1,47 @@
+package com.fishercoder.solutions;
+
+import java.util.LinkedList;
+import java.util.Queue;
+
+public class _1765 {
+    public static class Solution1 {
+        public int[][] highestPeak(int[][] isWater) {
+            int m = isWater.length;
+            int n = isWater[0].length;
+            int[][] result = new int[m][n];
+            Queue<int[]> queue = new LinkedList<>();
+            for (int i = 0; i < m; i++) {
+                for (int j = 0; j < n; j++) {
+                    if (isWater[i][j] == 1) {
+                        queue.offer(new int[]{i, j});
+                    }
+                }
+            }
+            int[] directions = new int[]{0, 1, 0, -1, 0};
+            int height = 1;
+            while (!queue.isEmpty()) {
+                int size = queue.size();
+                for (int j = 0; j < size; j++) {
+                    int[] curr = queue.poll();
+                    for (int i = 0; i < directions.length - 1; i++) {
+                        int newx = directions[i] + curr[0];
+                        int newy = directions[i + 1] + curr[1];
+                        if (newx >= 0 && newx < m && newy >= 0 && newy < n && result[newx][newy] == 0) {
+                            result[newx][newy] = height;
+                            queue.offer(new int[]{newx, newy});
+                        }
+                    }
+                }
+                height++;
+            }
+            for (int i = 0; i < m; i++) {
+                for (int j = 0; j < n; j++) {
+                    if (isWater[i][j] == 1) {
+                        result[i][j] = 0;
+                    }
+                }
+            }
+            return result;
+        }
+    }
+}
