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

题解：

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