码迷,mamicode.com
首页 > 其他好文 > 详细

Leetcode-1 Two Sum

时间:2016-11-20 18:36:12      阅读:183      评论:0      收藏:0      [点我收藏+]

标签:return   get   use   add   row   bre   暴力求解   sum   ber   

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

Example:

Given nums = [2, 7, 11, 15], target = 9,

Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].

 题解:暴力求解,时间复杂度O(n2)

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

 

Leetcode-1 Two Sum

标签:return   get   use   add   row   bre   暴力求解   sum   ber   

原文地址:http://www.cnblogs.com/fengxw/p/6082938.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!