leetcode 167

Author: geekplux

README.md

@@ -6,10 +6,11 @@
 
 ## leetcode
 
-- 1. Two Sum `easy` `array` [link](https://leetcode.com/problems/two-sum/description/) [code](./leetcode_1_two_sum_easy_array.js)
+- 1. Two Sum `easy` `array` [link](https://leetcode.com/problems/two-sum/description/) [code](./leetcode_1.js)
+- 1. Two Sum II `easy` `array` [link](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/description/) [code](./leetcode_167.js)
 
 ## lintcode
 
-- 407. Plus One `easy` `string` [link](https://lintcode.com/problem/plus-one/description) [code](./lintcode_407_plus_one_easy_string.js)
+- 407. Plus One `easy` `string` [link](https://lintcode.com/problem/plus-one/description) [code](./lintcode_407.js)
 
 

leetcode_1_two_sum_easy_array.js renamed to leetcode_1.js

@@ -0,0 +1,34 @@
+/*
+Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target number.
+
+The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2.
+
+Note:
+
+Your returned answers (both index1 and index2) are not zero-based.
+You may assume that each input would have exactly one solution and you may not use the same element twice.
+
+Example:
+
+Input: numbers = [2,7,11,15], target = 9
+Output: [1,2]
+Explanation: The sum of 2 and 7 is 9. Therefore index1 = 1, index2 = 2.
+*/
+
+/**
+ * @param {number[]} numbers
+ * @param {number} target
+ * @return {number[]}
+ */
+var twoSum = function(numbers, target) {
+  let indices;
+  const map = new Map;
+  numbers.map((n, i) => {
+    const complement = target - n;
+    if (map.has(complement)) indices = [map.get(complement) + 1, i + 1];
+    map.set(n, i);
+  });
+  return indices;
+};
+
+console.log(twoSum([2, 7, 11, 15], 9));