LeetCode——Two Sum

1. Two Sum

Easy

13139473Add to ListShare

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

法一 暴力解决,C++

class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {

        vector<int>result;
        for( int i=0 ; i<nums.size();i++){
            for(int j=i+1 ;j<nums.size();j++){
                
                if( nums[j] == target - nums[i])
                {
                    result.push_back(i);
                    result.push_back(j);
                    return result;
                }
                   
            }
           
        }
        return result;
    }
};

 

发布了45 篇原创文章 · 获赞 13 · 访问量 3万+
展开阅读全文

没有更多推荐了,返回首页

©️2019 CSDN 皮肤主题: 编程工作室 设计师: CSDN官方博客

分享到微信朋友圈

×

扫一扫,手机浏览