问题:
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.
常规解法,时间复杂度较高,O(n2);
class Solution {
public:vector<int> twoSum(vector<int>& nums, int target) {
for(int nFirstIndex = 0; nFirstIndex < nums.size(); nFirstIndex++)
{
for(int nSecondIndex = nFirstIndex + 1; nSecondIndex < nums.size(); nSecondIndex++)
{
if(nums[nFirstIndex] + nums[nSecondIndex] == target)
{
nums.clear();
nums.push_back(nFirstIndex);
nums.push_back(nSecondIndex);
return nums;
}
}
}
}
};