refactor 1

fishercoder1534 · fishercoder1534 · commit 0dd40b3d29ab · 2019-09-25T06:57:47.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_1.java b/src/main/java/com/fishercoder/solutions/_1.java
@@ -8,6 +8,7 @@
  *
  * 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,

Original file line number	Diff line number	Diff line change
`@@ -8,6 +8,7 @@`
`8`	`8`	`*`
`9`	`9`	`* Given an array of integers, return indices of the two numbers such that they add up to a specific target.`
`10`	`10`	`* You may assume that each input would have exactly one solution, and you may not use the same element twice.`
	`11`	`+ *`
`11`	`12`	`* Example:`
`12`	`13`	`* Given nums = [2, 7, 11, 15], target = 9,`
`13`	`14`	`* Because nums[0] + nums[1] = 2 + 7 = 9,`