fix:239

Author: wind-liang

leetCode-127-Word-Ladder.md

@@ -210,13 +210,12 @@ private boolean bfsHelper(Set<String> set1, Set<String> set2, Set<String> wordSe
 
 ```C++
 public class Solution {
-
-    public int ladderLength(String beginWord, String endWord, Set<String> wordList) {
+    public int ladderLength(String beginWord, String endWord, List<String> wordList) {
+        if(!wordList.contains(endWord)) return 0;
         Set<String> beginSet = new HashSet<String>(), endSet = new HashSet<String>();
-
         int len = 1;
         HashSet<String> visited = new HashSet<String>();
-
+        HashSet<String> dict = new HashSet<String>(wordList);
         beginSet.add(beginWord);
         endSet.add(endWord);
         while (!beginSet.isEmpty() && !endSet.isEmpty()) {
@@ -240,19 +239,17 @@ public class Solution {
                             return len + 1;
                         }
 
-                        if (!visited.contains(target) && wordList.contains(target)) {
+                        if (!visited.contains(target) && dict.contains(target)) {
                             temp.add(target);
                             visited.add(target);
                         }
                         chs[i] = old;
                     }
                 }
             }
-
             beginSet = temp;
             len++;
         }
-
         return 0;
     }
 }

leetcode-239-Sliding-Window-Maximum.md

@@ -160,7 +160,7 @@ public int[] maxSlidingWindow(int[] nums, int k) {
 
 参考 [这里](https://leetcode.com/problems/sliding-window-maximum/discuss/65881/O(n)-solution-in-Java-with-two-simple-pass-in-the-array) ，一种神奇的解法，有点 [238 题](https://leetcode.wang/leetcode-238-Product-of-Array-Except-Self.html) 解法二的影子。
 
-我们把数组 `k` 个一组就行分组。
+我们把数组 `k` 个一组进行分组。
 
 ``` java
 nums = [1,3,-1,-3,5,3,6,7], and k = 3
@@ -187,13 +187,13 @@ i 到 j 范围内的数字被分割线分成了两部分
 int rightMax[] = new int[n];
 max = Integer.MIN_VALUE;
 for (int i = n - 1; i >= 0; i--) {
-    if (i % k == 0) {
-        max = Integer.MIN_VALUE;
-    }
     if (max < nums[i]) {
         max = nums[i];
     }
     rightMax[i] = Math.max(nums[i], max);
+    if (i % k == 0) {
+        max = Integer.MIN_VALUE;
+    }
 }
 ```
 
@@ -249,13 +249,13 @@ public int[] maxSlidingWindow(int[] nums, int k) {
     int rightMax[] = new int[n];
     max = Integer.MIN_VALUE;
     for (int i = n - 1; i >= 0; i--) {
-        if (i % k == 0) {
-            max = Integer.MIN_VALUE;
-        }
         if (max < nums[i]) {
             max = nums[i];
         }
         rightMax[i] = Math.max(nums[i], max);
+        if (i % k == 0) {
+            max = Integer.MIN_VALUE;
+        }
     }
 
     int result[] = new int[n - k + 1];