FilesExpand file tree

 master

/

TwoSum1.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

47 lines (38 loc) · 1.19 KB

 master

/

TwoSum1.java

Copy path

Top

File metadata and controls

• Code
• Blame

47 lines (38 loc) · 1.19 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

/**

* 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].

*/

import java.util.HashMap;

import java.util.Map;

public class TwoSum1 {

public int[] twoSum(int[] nums, int target) {

Map<Integer, Integer> foundSet = new HashMap<>();

int[] returns = new int[2];

for (int i = 0; i < nums.length; i++) {

Integer now = nums[i];

Integer lookingfor = target - now;

if (foundSet.containsKey(lookingfor)) {

returns[0] = foundSet.get(lookingfor);

returns[1] = i;

return returns;

} else {

foundSet.put(now, i);

}

}

return returns;

}

public static void main(String[] args) {

TwoSum1 ts = new TwoSum1();

System.out.println(ts.twoSum(new int[]{2, 7, 11, 15}, 9));

System.out.println(ts.twoSum(new int[]{1, 2, 3}, 5));

}

}