Add solution #1

JoshCrozier · JoshCrozier · commit ea056c65e76d · 2023-01-16T17:49:08.000-06:00
diff --git a/0001-two-sum.js b/0001-two-sum.js
@@ -3,9 +3,11 @@
  * https://leetcode.com/problems/two-sum/
  * Difficulty: Easy
  *
- * Given an array of integers `nums` and an integer `target`, return indices of the two numbers such that they add up to `target`.
+ * Given an array of integers `nums` and an integer `target`, return indices
+ * of the two numbers such that they add up to `target`.
  *
- * You may assume that each input would have exactly one solution, and you may not use the same element twice.
+ * You may assume that each input would have exactly one solution, and you
+ * may not use the same element twice.
  *
  * You can return the answer in any order.
  */

Original file line number	Diff line number	Diff line change
`@@ -3,9 +3,11 @@`
`3`	`3`	`* https://leetcode.com/problems/two-sum/`
`4`	`4`	`* Difficulty: Easy`
`5`	`5`	`*`
`6`		- * Given an array of integers `nums` and an integer `target`, return indices of the two numbers such that they add up to `target`.
	`6`	+ * Given an array of integers `nums` and an integer `target`, return indices
	`7`	+ * of the two numbers such that they add up to `target`.
`7`	`8`	`*`
`8`		`- * You may assume that each input would have exactly one solution, and you may not use the same element twice.`
	`9`	`+ * You may assume that each input would have exactly one solution, and you`
	`10`	`+ * may not use the same element twice.`
`9`	`11`	`*`
`10`	`12`	`* You can return the answer in any order.`
`11`	`13`	`*/`