LeetCode:NO.1Two Sum
题目描述
Given an array of integers, return indices of the two numbers such that they add up to a specific target.
You may assume that each input would have exactly one solution, and you may not use the same element twice.
示例
Given nums = [2, 7, 11, 15], target = 9,
Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].
代码(暴力实现 复杂度O(n^2))
class Solution {
private:
int target;
public:
vector<int> twoSum(vector<int>& nums, int target) {
for(int i = 0; i < nums.size(); i++)
for(int j = i+1; j < nums.size(); j++){
if(nums[i]+nums[j] == target){
cout << i <<" "<< j<<endl;
return vector<int> {i,j};
}
}
}
};