Skip to content

Commit ed2dbff

Browse files
authored
Merge pull request #3 from colorbox/1
1. Two Sum
2 parents 62538c6 + b2b3a77 commit ed2dbff

File tree

4 files changed

+69
-0
lines changed

4 files changed

+69
-0
lines changed

1/1.cpp

Lines changed: 19 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,19 @@
1+
class Solution {
2+
public:
3+
vector<int> twoSum(vector<int>& nums, int target) {
4+
map<int, int> numMap;
5+
6+
int index = 0;
7+
int currentTargetNum = 0;
8+
for(; index < nums.size(); index++){
9+
currentTargetNum = target - nums[index];
10+
if(numMap.find(currentTargetNum) != numMap.end() && index != numMap[currentTargetNum]){
11+
break;
12+
}
13+
14+
numMap[nums[index]] = index;
15+
}
16+
17+
return { index, numMap[currentTargetNum] };
18+
}
19+
};

1/2.cpp

Lines changed: 18 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,18 @@
1+
class Solution {
2+
public:
3+
vector<int> twoSum(vector<int>& nums, int target) {
4+
map<int, int> numMap;
5+
6+
int index, currentTargetNum;
7+
for(index = 0; index < nums.size(); index++){
8+
currentTargetNum = target - nums[index];
9+
if(numMap.find(currentTargetNum) != numMap.end()){
10+
break;
11+
}
12+
13+
numMap[nums[index]] = index;
14+
}
15+
16+
return { index, numMap[currentTargetNum] };
17+
}
18+
};

1/3.cpp

Lines changed: 17 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,17 @@
1+
class Solution {
2+
public:
3+
vector<int> twoSum(vector<int>& nums, int target) {
4+
map<int, int> numMap;
5+
int currentOther, index;
6+
7+
for(index = 0; index < nums.size(); index++){
8+
currentOther = target - nums[index];
9+
if(numMap.find(currentOther) != numMap.end()){
10+
break;
11+
}
12+
numMap[nums[index]] = index;
13+
}
14+
15+
return { index, numMap[currentOther] };
16+
}
17+
};

1/4.cpp

Lines changed: 15 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,15 @@
1+
class Solution {
2+
public:
3+
vector<int> twoSum(vector<int>& nums, int target) {
4+
map<int, int> numMap;
5+
for(int index = 0; index < nums.size(); index++){
6+
int numToFind = target - nums[index];
7+
if(numMap.find(numToFind) != numMap.end()){
8+
return { index, numMap[numToFind] };
9+
}
10+
numMap[nums[index]] = index;
11+
}
12+
13+
return {};
14+
}
15+
};

0 commit comments

Comments
 (0)