FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
LeetCode-Solutions/Java/two-sum.java at master · eshaprk/LeetCode-Solutions · GitHub
eshaprk
/
LeetCode-Solutions
Public
forked from
kamyu104/LeetCode-Solutions
Notifications
You must be signed in to change notification settings
Fork
0
Star
1
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-Solutions
/
Java
/
two-sum.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
15 lines (14 loc) · 417 Bytes
Breadcrumbs
LeetCode-Solutions
/
Java
/
two-sum.java
Copy path
File metadata and controls
15 lines (14 loc) · 417 Bytes
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
// Time: O(n)
// Space: O(n)
class
Solution
{
public
int
[]
twoSum
(
int
[]
nums
,
int
target
) {
Map
<
Integer
,
Integer
>
lookup
=
new
HashMap
<>();
for
(
int
i
=
0
;
i
<
nums
.
length
;
i
++) {
if
(
lookup
.
containsKey
(
target
-
nums
[
i
])) {
return
new
int
[] {
lookup
.
get
(
target
-
nums
[
i
]),
i
};
}
lookup
.
put
(
nums
[
i
],
i
);
}
return
null
;
}
}
Back
|
FazBrowse Home
|
New Git URL