1. Two Sum
BruteForce
首先我们可以想到一个暴力破解的方法,每两个数字之间求和看是不是目标值,时间复杂度为 O ( n 2 ) O(n^2) O(n2)
vector<int> twoSum_BruteForce(vector<int> &nums, int target)
{
vector<int> res;
for (int i = 0; i < nums.size() - 1; ++i)
{
for (int j = i + 1; j < nums.size(); j++)
{
if ((nums[i] + nums[j]) == target)
{
res.push_back(i);
res.push_back(j);
}
}
}
return res;
}
Hash Table
利用Hash表存储索引与对应值,时间复杂度 O ( n ) O(n) O(n)
vector<int> twoSum(vector<int> &nums, int target)
{
vector<int> res;
unordered_map<int, int> hash;
for (int i = 0; i < nums.size(); i++)
{
if (hash.find(target - nums[i]) != hash.end())
{
res.push_back(i);
res.push_back(hash[target - nums[i]]);
return res;
}
hash[nums[i]] = i;
}
return res;
}
15. 3Sum
BruteForce
我们首先也可以想到一种暴力破解的方式,时间复杂度为 O ( n 3 ) O(n^3) O(n3),这样的方法肯定会超时。
vector<vector<int>> threeSum_BruteForce(vector<int> &nums)
{
vector<vector<int>> res;
sort(nums.begin(), nums.end());
for (int i = 0; i < nums.size() - 2; ++i)
{
for (int j = i + 1; j < nums.size() - 1; ++j)
{
for (int k = j + 1; j < nums.size(); ++k)
{
if ((nums[i] + nums[j] + nums[k]) == 0)
{
vector<int> tmp;
tmp.push_back(nums[i]);
tmp.push_back(nums[j]);
tmp.push_back(nums[k]);
res.push_back(tmp);
}
}
}
}
res.erase(unique(res.begin(), res.end()), res.end());//Remove duplicate
return res;
}