1 求和

作者: followyounger1 | 来源:发表于2017-09-03 13:45 被阅读6次

    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].

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

    相关文章

      网友评论

          本文标题:1 求和

          本文链接:https://www.haomeiwen.com/subject/adxjjxtx.html