首页 > 代码库 > 1. Two Sum
1. Two Sum
Problem statement:
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].
Solution one: hash table
This is a very classical question. It is asked most times in interview. According to the description, we need to return the indices of two numbers whose sum is equal to the target. By checking and inserting current number into a hash table, we can find the answer or for following searching.
Time complexity is O(n). Space complexity is O(n).
class Solution {public: vector<int> twoSum(vector<int>& nums, int target) { unordered_map<int, int> hash_table; // <sum, index> for(int i = 0; i < nums.size(); i++){ if(hash_table.count(target - nums[i])){ return {hash_table[target - nums[i]], i}; } else { hash_table[nums[i]] = i; } } return {0, 0}; }};
1. Two Sum
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。