Skip to content

Commit c4cb134

Browse files
refactor 1
1 parent 2f10045 commit c4cb134

File tree

1 file changed

+0
-11
lines changed
  • src/main/java/com/fishercoder/solutions

1 file changed

+0
-11
lines changed

src/main/java/com/fishercoder/solutions/_1.java

Lines changed: 0 additions & 11 deletions
Original file line numberDiff line numberDiff line change
@@ -3,17 +3,6 @@
33
import java.util.HashMap;
44
import java.util.Map;
55

6-
/**
7-
* 1. Two Sum
8-
*
9-
* Given an array of integers, return indices of the two numbers such that they add up to a specific target.
10-
* You may assume that each input would have exactly one solution, and you may not use the same element twice.
11-
*
12-
* Example:
13-
* Given nums = [2, 7, 11, 15], target = 9,
14-
* Because nums[0] + nums[1] = 2 + 7 = 9,
15-
* return [0, 1].
16-
*/
176
public class _1 {
187

198
public static class Solution1 {

0 commit comments

Comments
 (0)