【LeetCode】1. Two Sum

传送门：https://leetcode.com/problems/two-sum/#/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].

---

三、问题描述

给定一个数字和一个目标数字，求出数组中两个数字之和等于给定的目标数字。
注意：假定每个数组中有且只有一组解，不能使用同一个数组元素两次
例如：数组[2,7,11,15], 目标数字9，因为nums[0] + nums[1] = 9,所以返回[0,1]

四、分析

遍历数组法，直接遍历整个数组，找到两个数组元素和等于target即可

五、实现

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