update: 补齐缺失文件

Author: hijiangtao

.gitignore

@@ -0,0 +1 @@
+.idea/*

src/minimum-time-difference/res.js

@@ -0,0 +1,40 @@
+/**
+ * @param {string[]} timePoints
+ * @return {number}
+ */
+let findMinDifference = function(timePoints) {
+    let len = timePoints.length;
+    if (len === 1) return 0;
+
+    let tarray = new Array(24*60),
+        min = 1441,
+        max = -1,
+        res = 1441,
+        prev = 0;
+
+    for (let i=0; i<len; i++) {
+        let tmplist = timePoints[i].split(':'),
+            minute = (tmplist[0]-'0')*60 + (tmplist[1]-'0');
+
+        if (tarray[minute]) {
+            return 0;
+        } else {
+            tarray[minute] = true;
+        }
+    }
+
+    for (let i=0; i<1440; i++) {
+        if (tarray[i]) {
+            if (min !== 1441) {
+                res = Math.min(res, i-prev);
+            } else {
+                min = i;
+            }
+
+            max = Math.max(max, i);
+            prev = i;
+        }
+    }
+
+    return Math.min(res, 24*60-max+min);
+};

src/predict-the-winner/res.js

@@ -0,0 +1,18 @@
+/**
+ * @param {number[]} nums
+ * @return {boolean}
+ */
+let PredictTheWinner = function(nums) {
+    let len = nums.length,
+        res = new Array(len).fill([]);
+
+    for (let i=len-1; i>=0; i--) {
+        for (let j=i; j<len; j++) {
+            if (i==j) res[i] = nums[i];
+            else res[j] = Math.max(nums[i]-res[j], nums[j]-res[j-1]);
+        }
+    }
+
+    return res[len-1] >= 0;
+};
+