Skip to content

created 1_Two_sum.cpp #732

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: main
Choose a base branch
from
Open
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
16 changes: 16 additions & 0 deletions LeetCode Solutions/1_Two_sum.cpp
Original file line number Diff line number Diff line change
@@ -0,0 +1,16 @@
class Solution{
public:
vector<int> twoSum(vector<int>& nums, int target){
unordered_map<int,int>mp; //<value,index>
vector<int>res;
for(int i=0;i<nums.size();i++){
if(mp.count(nums[i])){ //if number is found in map
res.push_back(mp[nums[i]]);
res.push_back(i);
break;
}
mp[target-nums[i]]=i;
}
return res;
}
};