Merge branch 'master' of https://github.com/azl397985856/leetcode

Author: lucifer

problems/11.container-with-most-water.md

@@ -71,53 +71,13 @@ eg:
 JavaScript Code:
 
 ```js
-/*
- * @lc app=leetcode id=11 lang=javascript
- *
- * [11] Container With Most Water
- *
- * https://leetcode.com/problems/container-with-most-water/description/
- *
- * algorithms
- * Medium (42.86%)
- * Total Accepted:    344.3K
- * Total Submissions: 790.1K
- * Testcase Example:  '[1,8,6,2,5,4,8,3,7]'
- *
- * Given n non-negative integers a1, a2, ..., an , where each represents a
- * point at coordinate (i, ai). n vertical lines are drawn such that the two
- * endpoints of line i is at (i, ai) and (i, 0). Find two lines, which together
- * with x-axis forms a container, such that the container contains the most
- * water.
- * 
- * Note: You may not slant the container and n is at least 2.
- * 
- * 
- * 
- * 
- * 
- * The above vertical lines are represented by array [1,8,6,2,5,4,8,3,7]. In
- * this case, the max area of water (blue section) the container can contain is
- * 49. 
- * 
- * 
- * 
- * Example:
- * 
- * 
- * Input: [1,8,6,2,5,4,8,3,7]
- * Output: 49
- * 
- */
 /**
  * @param {number[]} height
  * @return {number}
  */
 var maxArea = function(height) {
     if (!height || height.length <= 1) return 0;
 
-    // 双指针来进行优化
-    // 时间复杂度是O(n)
     let leftPos = 0;
     let rightPos = height.length - 1;
     let max = 0;
@@ -154,3 +114,12 @@ public:
     }
 };
 ```
+
+***复杂度分析***
+- 时间复杂度：$O(N)$
+- 空间复杂度：$O(1)$
+
+
+大家也可以关注我的公众号《脑洞前端》获取更多更新鲜的LeetCode题解
+
+![](https://pic.leetcode-cn.com/89ef69abbf02a2957838499a96ce3fbb26830aae52e3ab90392e328c2670cddc-file_1581478989502)

problems/200.number-of-islands.md

@@ -53,7 +53,37 @@ Output: 3
 
 ## 代码
 
-* 语言支持：JS, python3
+* 语言支持：JS, python3，Java
+
+Java Code：
+
+```java
+   public int numIslands(char[][] grid) {
+        if (grid == null || grid.length == 0 || grid[0].length == 0) return 0;
+
+        int count = 0;
+        for (int row = 0; row < grid.length; row++) {
+            for (int col = 0; col < grid[0].length; col++) {
+                if (grid[row][col] == '1') {
+                    dfs(grid, row, col);
+                    count++;
+                }
+            }
+        }
+        return count;
+    }
+
+    private void dfs(char[][] grid,int row,int col) {
+        if (row<0||row== grid.length||col<0||col==grid[0].length||grid[row][col]!='1') {
+            return;
+        }
+        grid[row][col] = '0';
+        dfs(grid, row-1, col);
+        dfs(grid, row+1, col);
+        dfs(grid, row, col+1);
+        dfs(grid, row, col-1);
+    }
+```
 
 Javascript Code:
 ```js

problems/55.jump-game.md

@@ -26,9 +26,7 @@ Explanation: You will always arrive at index 3 no matter what. Its maximum
 
 ## 思路
 
-这道题目是一道典型的`回溯`类型题目。
-思路就是用一个变量记录当前能够到达的最大的索引，我们逐个遍历数组中的元素去更新这个索引。
-变量完成判断这个索引是否大于数组下表即可。
+这道题目是一道典型的`贪心`类型题目。思路就是用一个变量记录当前能够到达的最大的索引，我们逐个遍历数组中的元素去更新这个索引。变量完成判断这个索引是否大于数组下表即可。
 ## 关键点解析
 
 - 建模 (记录和更新当前位置能够到达的最大的索引即可)
@@ -38,48 +36,6 @@ Explanation: You will always arrive at index 3 no matter what. Its maximum
 * 语言支持: Javascript，Python3
 
 ```js
-
-/*
- * @lc app=leetcode id=55 lang=javascript
- *
- * [55] Jump Game
- *
- * https://leetcode.com/problems/jump-game/description/
- *
- * algorithms
- * Medium (31.38%)
- * Total Accepted:    252.4K
- * Total Submissions: 797.2K
- * Testcase Example:  '[2,3,1,1,4]'
- *
- * Given an array of non-negative integers, you are initially positioned at the
- * first index of the array.
- *
- * Each element in the array represents your maximum jump length at that
- * position.
- *
- * Determine if you are able to reach the last index.
- *
- * Example 1:
- *
- *
- * Input: [2,3,1,1,4]
- * Output: true
- * Explanation: Jump 1 step from index 0 to 1, then 3 steps to the last
- * index.
- *
- *
- * Example 2:
- *
- *
- * Input: [3,2,1,0,4]
- * Output: false
- * Explanation: You will always arrive at index 3 no matter what. Its
- * maximum
- * jump length is 0, which makes it impossible to reach the last index.
- *
- *
- */
 /**
  * @param {number[]} nums
  * @return {boolean}
@@ -112,3 +68,11 @@ class Solution:
                 return True
         return _max >= _len - 1
 ```
+
+***复杂度分析***
+- 时间复杂度：$O(N)$
+- 空间复杂度：$O(1)$
+
+更多题解可以访问我的LeetCode题解仓库：https://github.com/azl397985856/leetcode  。 目前已经30K star啦。
+
+大家也可以关注我的公众号《脑洞前端》获取更多更新鲜的LeetCode题解