LeetCode 1. Two Sum

最新推荐文章于 2020-11-21 22:03:15 发布

sqyx008

最新推荐文章于 2020-11-21 22:03:15 发布

阅读量209

点赞数

分类专栏： LeetCode 文章标签： leetcode numbers cpp sum vector

本文链接：https://blog.csdn.net/sqyx008/article/details/67640515

版权

LeetCode 专栏收录该内容

66 篇文章 0 订阅

订阅专栏

Description

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

Code

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