FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
leetcode/problems/src/hashing/TwoSum.java at master · KindleBooks66/leetcode · GitHub
Uh oh!
There was an error while loading.
Please reload this page
.
KindleBooks66
/
leetcode
Public
forked from
gouthampradhan/leetcode
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
leetcode
/
problems
/
src
/
hashing
/
TwoSum.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
58 lines (53 loc) · 1.42 KB
Breadcrumbs
leetcode
/
problems
/
src
/
hashing
/
TwoSum.java
Copy path
File metadata and controls
58 lines (53 loc) · 1.42 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
52
53
54
55
56
57
58
package
hashing
;
import
java
.
util
.
HashMap
;
/**
* Created by gouthamvidyapradhan on 09/03/2017. Given an array of integers, return indices of the
* two numbers such that they add up to a specific target.
*
* <p>You may assume that each input would have exactly one solution, and you may not use the same
* element twice.
*
* <p>Example: Given nums = [2, 7, 11, 15], target = 9,
*
* <p>Because nums[0] + nums[1] = 2 + 7 = 9, return [0, 1].
*/
public
class
TwoSum
{
HashMap
<
Integer
,
Integer
>
map
=
new
HashMap
<>();
public
int
[]
twoSum
(
int
[]
nums
,
int
target
) {
int
[]
result
=
new
int
[
2
];
for
(
int
i
:
nums
) {
if
(
map
.
keySet
().
contains
(
i
)) {
int
count
=
map
.
get
(
i
);
map
.
put
(
i
, ++
count
);
}
else
{
map
.
put
(
i
,
1
);
}
}
for
(
int
i
=
0
,
l
=
nums
.
length
;
i
<
l
;
i
++) {
int
ele
=
nums
[
i
];
int
req
=
target
-
ele
;
if
(
map
.
keySet
().
contains
(
req
)) {
result
[
0
] =
i
;
if
(
ele
==
req
) {
int
count
=
map
.
get
(
req
);
if
(
count
>
1
) {
for
(
int
j
=
i
+
1
;
j
<
l
;
j
++) {
if
(
nums
[
j
] ==
req
) {
result
[
1
] =
j
;
return
result
;
}
}
}
}
else
{
for
(
int
j
=
i
+
1
;
j
<
l
;
j
++) {
if
(
nums
[
j
] ==
req
) {
result
[
1
] =
j
;
return
result
;
}
}
}
}
}
return
result
;
}
}
Back
|
FazBrowse Home
|
New Git URL