We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 5e21866 commit 51642c0Copy full SHA for 51642c0
CPP/Problems/two-sum.cpp
@@ -1,13 +1,22 @@
1
class Solution {
2
public:
3
vector<int> twoSum(vector<int>& nums, int target) {
4
- unordered_map<int,int> m;
5
- for(int i=0;i<nums.size();i++){
6
- if(m.find(target-nums[i]) != m.end()){
7
- return {m[target-nums[i]],i};
+ int n=nums.size();
+ vector<int>v;
+ for(int i=0;i<n;i++)
+ {
8
+ for(int j=i+1;j<n;j++)
9
10
+ if(nums[i]+nums[j]==target)
11
12
+ v.push_back(i);
13
+ v.push_back(j);
14
+ return v;
15
+ }
16
}
- m[nums[i]]=i;
17
- return {};
18
+ v.push_back(-1);
19
20
+
21
22
};
0 commit comments