[LeetCode]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(n^2)$ 的算法

暴力枚举

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[i] + nums[j] == target) {
                    result.push_back(i);
                    result.push_back(j);
                    return result;
                }
            }
        }
        result.push_back(-1);
        result.push_back(-1);
        return result;
    }
};

---