LeetCode - TwoSum

最新推荐文章于 2016-01-28 14:36:59 发布

梁奎

最新推荐文章于 2016-01-28 14:36:59 发布

阅读量246

点赞数

本文链接：https://blog.csdn.net/Matthew_lk/article/details/50492154

版权

LeetCode Online Judge 专栏收录该内容

43 篇文章 0 订阅

订阅专栏

1.Two Sum

题目描述：

Given an arrayof integers, find two numbers such that they add up to a specific targetnumber.The function twoSum should return indices of the two numbers such thatthey add up to the target, where index1 must be less than index2. Please notethat your returned answers (both index1 and index2) are not zero-based.

You may assumethat each input would have exactly one solution.

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

题目大意：给定一个数组，找出数组中两个数相加等于目标值，返回这两个数的索引值。

方法一：

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

该方法时间复杂度O（N^2）,代码提交超时。

方法二：

typedef struct Node{
   int id,value;
}Node;
 
bool compare(const Node& a, constNode& b){
   return a.value < b.value;
}
 
class Solution {
public:
   vector<int> twoSum(vector<int>& nums, int target) {
   Node nodes[nums.size()];
   for(unsigned int i=0; i<nums.size(); i++){
       nodes[i].id = i+1;
       nodes[i].value = nums[i];
    }
   sort(nodes, nodes+nums.size(),compare);
   vector<int> result;
   int start = 0, end = nums.size()-1;
   while(start<end){
       if(nodes[start].value + nodes[end].value == target){
           if(nodes[start].id > nodes[end].id)
                swap(nodes[start].id,nodes[end].id);
           result.push_back(nodes[start].id);
           result.push_back(nodes[end].id);
           return result;
       }
       else if(nodes[start].value + nodes[end].value<target){
           start++;
       }
       else
           end--;
    }
    }
};

本方法先排序，然后在从两端往中间查找，时间复杂度为O(NlogN)，比较好理解。

方法三：

<pre name="code" class="cpp">class Solution {
    private:
        map<int, int> idOfNum;
    public:
        vector<int> twoSum(vector<int> &numbers, int target) {
            vector<int> index;
            idOfNum.clear();

            int sz = numbers.size();
            for (int i = 0; i < sz; i++) {
                int rest = target - numbers[i];
                if (idOfNum.find(rest) != idOfNum.end()) {
                    index.push_back(idOfNum[rest]);
                    index.push_back(i + 1);
                    return index;
                }
                idOfNum[numbers[i]] = i + 1;
            }
            // Program never go here, because
            // "each input would have exactly one solution"
        }
};

方法四：

classSolution(object):
    def twoSum(self, nums, target):
        """
        :type nums:List[int]
        :typetarget: int
        :rtype:List[int]
       """
        d={}
        fori,v in enumerate(nums):  #python 特有的枚举类型函数
            if target-v in d:
                return[d[target-v],i+1]
            d[v]=i+1

方法四是用python语言编写的，参考了讨论组其他人的解法，主要是理解python中enumerate()用法

这是我第一次做leetcode，希望自己可以坚持下去，把自己学习的都能够详尽的记录下来。