Merge pull request gzc426#558 from mztxsir/master

1

Author: gzc426

2018.12.23-leetcode392/WYJ.md

@@ -0,0 +1,20 @@
+```java
+class Solution {
+    public boolean isSubsequence(String s, String t) {
+        if(s.length() == 0){
+            return true;
+        }
+        int indexS = 0, indexT = 0;
+        while(indexT < t.length()){
+            if(t.charAt(indexT) == s.charAt(indexS)){
+                indexS++;
+            }
+            indexT++;
+            if(indexS == s.length()){
+                return true;
+            }
+        }
+        return false;
+    }
+}
+```

2018.12.24-leetcode665/WYJ.md

@@ -0,0 +1,49 @@
+```java
+class Solution {
+    public boolean checkPossibility(int[] nums) {
+        if(nums.length == 0 || nums.length == 1){
+            return true;
+        }
+        List<int[]> index = new ArrayList<>();
+        for(int i = 0; i < nums.length - 1; i++){
+            if(nums[i] > nums[i + 1]){
+                if(i == 0){
+                    index.add(new int[]{i, nums[i + 1]});
+                }
+                else if(nums[i - 1] > nums[i + 1]){
+                    //index.add(new int[]{i, nums[i + 1]});
+                    index.add(new int[]{i + 1, nums[i]});
+                }
+                else{
+                    index.add(new int[]{i, nums[i + 1]});
+                }
+                
+            }
+        }
+        if(index.size() == 0){
+            return true;
+        }
+        for(int i = 0; i < index.size(); i++){
+            int[] nums1 = nums.clone();
+            int[] change = index.get(i);
+            for(int j = 0; j < nums1.length; j++){
+                if(j == change[0]){
+                    nums1[j] = change[1];
+                }
+            }
+            if(isNonde(nums1)){
+                return true;
+            }
+        }
+        return false;
+    }
+    public boolean isNonde(int[] nums){
+        for(int i = 0; i < nums.length - 1; i++){
+            if(nums[i] > nums[i + 1]){
+                return false;
+            }
+        }
+        return true;
+    }
+}
+```