关闭

LeetCode:Two Sum

269人阅读 评论(0) 收藏 举报
分类:

Given an array of integers, find two numbers such that they add up to a specific target number.

The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please note that your returned answers (both index1 and index2) are not zero-based.

You may assume that each input would have exactly one solution.

Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2

Solution 1:Runtime: 48 ms

class Solution {
public:
    vector<int> twoSum(vector<int> &numbers, int target) {
        vector<int> vec;
        for(int i=0;i!=numbers.size()-1;i++)
            for(int j=i+1;j!=numbers.size();j++)
                if(numbers[i]+numbers[j]==target){
                    vec.push_back(i+1);
                    vec.push_back(j+1);
                    break;
                }
        return vec;
    }
};

Solution 2:Runtime:12ms

class Solution {
public:
    vector<int> twoSum(vector<int> &numbers, int target) {
        map<int, int> table;
        map<int, int>::const_iterator iter;
        vector<int> result;
        for (int i = 0;i!=numbers.size();++i) {
            iter = table.find(target - numbers[i]);
            if (iter == table.end()) {
                table.insert(pair<int, int>(numbers[i], i));
            } else {
                result.push_back(iter->second + 1);
                result.push_back(i + 1);
                break;
            }
        }
        return result;
    }
};




0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:1640次
    • 积分:31
    • 等级:
    • 排名:千里之外
    • 原创:1篇
    • 转载:5篇
    • 译文:0篇
    • 评论:0条