FilesExpand file tree

 main

/

1.two-sum.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

52 lines (50 loc) · 1.15 KB

 main

/

1.two-sum.java

Copy path

Top

File metadata and controls

• Code
• Blame

52 lines (50 loc) · 1.15 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

48

49

50

51

import java.util.HashMap;

import java.util.Map;

/*

* @lc app=leetcode id=1 lang=java

*

* [1] Two Sum

*

* https://leetcode.com/problems/two-sum/description/

*

* algorithms

* Easy (43.77%)

* Total Accepted: 1.7M

* Total Submissions: 4M

* Testcase Example: '[2,7,11,15]\n9'

*

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

*

*

*

*

*/

class Solution {

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

int length = nums.length;

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

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

int theNum = nums[i];

container.put(theNum, i);

}

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

int theNum = nums[i];

if(container.containsKey(theNum)){

return new int[]{i, container.get(theNum)};

}

}

return new int[]{};

}

}