11.5 coding

Author: Whiskeyi

1. 两数之和.js

@@ -1,21 +1,16 @@
 /**
-  *
-  * @param numbers int整型一维数组
-  * @param target int整型
-  * @return int整型一维数组
-  */
- function twoSum( numbers ,  target ) {
-    // write code here
+ * @param {number[]} nums
+ * @param {number} target
+ * @return {number[]}
+ */
+var twoSum = function(nums, target) {
     let map = new Map();
-    for(let i = 0; i <= numbers.length - 1; i++) {
-        if(map.has(target - numbers[i])) {
-            return [map.get(target - numbers[i]) + 1, i + 1];
+    for (let i = 0; i < nums.length; i++) {
+        let matchNum = target - nums[i];
+        if (map.has(matchNum)) {
+            return [map.get(matchNum), i]
         } else {
-            map.set(numbers[i], i);
+            map.set(nums[i], i)
         }
     }
-    return [];
-}
-module.exports = {
-    twoSum : twoSum
 };

128. 最长连续序列.js

@@ -0,0 +1,29 @@
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var longestConsecutive = function (nums) {
+  // 去重存储原数组
+  let numSet = new Set(nums);
+  let maxLen = 0;
+  for (let num of numSet) {
+    if (!numSet.has(num - 1)) {
+      let curNum = num;
+      let curLen = 1;
+
+      // 只有是连续序列第一个数
+      while (numSet.has(curNum + 1)) {
+        curNum++;
+        curLen++;
+      }
+
+      maxLen = Math.max(maxLen, curLen);
+    }
+  }
+
+  return maxLen;
+};
+
+console.log(longestConsecutive([100, 4, 200, 1, 3, 2])); // 4
+// console.log(longestConsecutive([0,3,7,2,5,8,4,6,0,1])); // 9
+