- it技术
- leetcode:两数之和
class Solution {
public:
vector
<int> twoSum(vector
<int>& nums
, int target
) {
vector
<int>obj
;
int k
= -1;
for(int i
= 0;i
<nums
.size()-1;i
++){
if(i
== k
) continue;
int temp
= target
- nums
[i
];
for(int j
= i
+1;j
<nums
.size();j
++){
if(nums
[j
] == temp
){
obj
.push_back(i
);obj
.push_back(j
); k
= j
;
}
}
}
return obj
;
}
};
