two-sum

megatontech · web-flow · commit 7d43110b5134 · 2019-06-06T09:20:35.000+08:00
two-sum
diff --git a/two-sum b/two-sum
@@ -0,0 +1,10 @@
+Given an array of integers, return indices of the two numbers such that they add up to a specific target.
+
+You may assume that each input would have exactly one solution, and you may not use the same element twice.
+
+Example:
+
+Given nums = [2, 7, 11, 15], target = 9,
+
+Because nums[0] + nums[1] = 2 + 7 = 9,
+return [0, 1].
