Merge branch 'youngyangyang04:master' into master

problems/0135.分发糖果.md

@@ -132,30 +132,33 @@ public:
 Java：
 ```java
 class Solution {
+    /** 
+         分两个阶段 
+         1、起点下标1 从左往右，只要 右边 比 左边 大，右边的糖果=左边 + 1
+         2、起点下标 ratings.length - 2 从右往左， 只要左边 比 右边 大，此时 左边的糖果应该 取本身的糖果数（符合比它左边大） 和 右边糖果数 + 1 二者的最大值，这样才符合 它比它左边的大，也比它右边大
+    */
     public int candy(int[] ratings) {
-        int[] candy = new int[ratings.length];
-        for (int i = 0; i < candy.length; i++) {
-            candy[i] = 1;
-        }
-
+        int[] candyVec = new int[ratings.length];
+        candyVec[0] = 1;
         for (int i = 1; i < ratings.length; i++) {
             if (ratings[i] > ratings[i - 1]) {
-                candy[i] = candy[i - 1] + 1;
+                candyVec[i] = candyVec[i - 1] + 1;
+            } else {
+                candyVec[i] = 1;
             }
         }
 
         for (int i = ratings.length - 2; i >= 0; i--) {
             if (ratings[i] > ratings[i + 1]) {
-                candy[i] = Math.max(candy[i],candy[i + 1] + 1);
+                candyVec[i] = Math.max(candyVec[i], candyVec[i + 1] + 1);
             }
         }
 
-        int count = 0;
-        for (int i = 0; i < candy.length; i++) {
-            count += candy[i];
+        int ans = 0;
+        for (int s : candyVec) {
+            ans += s;
         }
-
-        return count;
+        return ans;
     }
 }
 ```

problems/0763.划分字母区间.md

@@ -88,15 +88,15 @@ Java：
 class Solution {
     public List<Integer> partitionLabels(String S) {
         List<Integer> list = new LinkedList<>();
-        int[] edge = new int[123];
+        int[] edge = new int[26];
         char[] chars = S.toCharArray();
         for (int i = 0; i < chars.length; i++) {
-            edge[chars[i] - 0] = i;
+            edge[chars[i] - 'a'] = i;
         }
         int idx = 0;
         int last = -1;
         for (int i = 0; i < chars.length; i++) {
-            idx = Math.max(idx,edge[chars[i] - 0]);
+            idx = Math.max(idx,edge[chars[i] - 'a']);
             if (i == idx) {
                 list.add(i - last);
                 last = i;

problems/1002.查找常用字符.md

@@ -224,10 +224,7 @@ javaScript
 var commonChars = function (words) {
 	let res = []
 	let size = 26
-	let firstHash = new Array(size)
-	for (let i = 0; i < size; i++) { // 初始化 hash 数组
-		firstHash[i] = 0
-	}
+	let firstHash = new Array(size).fill(0)   // 初始化 hash 数组
 
 	let a = "a".charCodeAt()
 	let firstWord = words[0]
@@ -236,20 +233,19 @@ var commonChars = function (words) {
 		firstHash[idx - a] += 1
 	}
 	
+	let otherHash = new Array(size).fill(0)    // 初始化 hash 数组
 	for (let i = 1; i < words.length; i++) { // 1-n 个单词统计
-		let otherHash = new Array(size)
-		for (let i = 0; i < size; i++) { // 初始化 hash 数组
-			otherHash[i] = 0
-		}
-
 		for (let j = 0; j < words[i].length; j++) {
 			let idx = words[i][j].charCodeAt()
 			otherHash[idx - a] += 1
 		}
+		
 		for (let i = 0; i < size; i++) {
 			firstHash[i] = Math.min(firstHash[i], otherHash[i])
 		}
+		otherHash.fill(0)
 	}
+	
 	for (let i = 0; i < size; i++) {
 		while (firstHash[i] > 0) {
 			res.push(String.fromCharCode(i + a))