1. Two 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.
Example:
Given nums = [2, 7, 11, 15], target = 9,
Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].
Python解法:
解法一:
暴搜,会出现Time Limit Exceeded(超时)问题,大概6320ms
class Solution:
def twoSum(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: List[int]
"""
result = []
for i in range(len(nums)):
for j in range(i+1,len(nums)):
if nums[i] + nums[j] == target:
result = [i,j]
return result
解法二:
利用python的字典格式(dictionary)建立哈希映射,将事件显著降低为40ms
class Solution:
def twoSum(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: List[int]
"""
hashtabel = {}
for i in range(len(nums)):
if nums[i] in hashtabel.keys():
result = [hashtabel[nums[i]],i]
return result
hashtabel[target - nums[i]] = i
return []
C++解法:
解法一:
暴搜,时间大概130ms
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
vector<int> result;
for ( int i = 0 ; i < nums.size() ; i++ ){
for ( int j = i+1 ; j < nums.size() ; j++ ){
if ( nums[j] == target - nums[i]){
result.push_back(i);
result.push_back(j);
return result;
}
}
}
}
};
解法二:
哈希构造映射,时间大概为8 ms
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
vector<int> result;
unordered_map<int, int> m;
for ( int i = 0 ; i < nums.size() ; i++ )
{
if(m.count(target-nums[i]))
{
result.push_back(m[target-nums[i]]);
result.push_back(i);
return result;
}
m[nums[i]] = i;
}
return result;
}
};