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, 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 n=nums.size();        vector<int> c;        c.clear();        for(int i=0;i<n;i++){            for(int j=i+1;j<n;j++){                if(nums[j]==target-nums[i]){                    c.push_back(i);                    c.push_back(j);                    return c;                }            else continue;                                }        }    }};