FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
Solving-LeetCode-Problems/Two Sum/Solution.java at main · thanthtooaung-coding/Solving-LeetCode-Problems · GitHub
thanthtooaung-coding
/
Solving-LeetCode-Problems
Public
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Issues
0
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Issues
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
Solving-LeetCode-Problems
/
Two Sum
/
Solution.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
19 lines (14 loc) · 490 Bytes
Breadcrumbs
Solving-LeetCode-Problems
/
Two Sum
/
Solution.java
Copy path
File metadata and controls
19 lines (14 loc) · 490 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
16
17
18
19
import
java
.
util
.
HashMap
;
class
Solution
{
public
int
[]
twoSum
(
int
[]
nums
,
int
target
) {
HashMap
<
Integer
,
Integer
>
map
=
new
HashMap
<>();
for
(
int
i
=
0
;
i
<
nums
.
length
;
i
++) {
int
complement
=
target
-
nums
[
i
];
if
(
map
.
containsKey
(
complement
)) {
return
new
int
[] {
map
.
get
(
complement
),
i
};
}
map
.
put
(
nums
[
i
],
i
);
}
return
new
int
[] {};
}
}
Back
|
FazBrowse Home
|
New Git URL