FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
DSA_Problems/LeetCode/0001_TwoSum.cpp at main · lakshitcodes/DSA_Problems · GitHub
lakshitcodes
/
DSA_Problems
Public
Notifications
You must be signed in to change notification settings
Fork
0
Star
1
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
DSA_Problems
/
LeetCode
/
0001_TwoSum.cpp
Copy path
More file actions
More file actions
Latest commit
History
History
History
22 lines (20 loc) · 605 Bytes
Breadcrumbs
DSA_Problems
/
LeetCode
/
0001_TwoSum.cpp
Copy path
File metadata and controls
22 lines (20 loc) · 605 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
20
21
22
#
include
<
bits/stdc++.h
>
using
namespace
std
;
//
Question Link : https://leetcode.com/problems/two_sum/
class
Solution
{
public:
vector<
int
>
twoSum
(vector<
int
>& nums,
int
target) {
unordered_map<
int
,
int
> map;
vector<
int
> ans;
for
(
int
i=
0
;i<nums.
size
();i++){
int
diff=target-nums[i];
if
(map.
count
(diff)){
ans.
push_back
(map[diff]);
ans.
push_back
(i);
return
ans;
}
map[nums[i]]=i;
}
return
ans;
}
};
Back
|
FazBrowse Home
|
New Git URL