Problem:

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

Summary:

给出数组nums和目标数target，返回数组中相加可得到target的索引值。

Solution:

1 vector
     
       twoSum(vector
      
       & nums, int target) { 2         vector
       
         result; 3         int flag = 0; 4          5         for(int i = 0; i < nums.size(); i++) 6         { 7             for(int j = i + 1; j < nums.size(); j++) 8             { 9                 if(nums[i] + nums[j] == target)10                 {11                     result.push_back(i);12                     result.push_back(j);13                     flag = 1;14                     break;15                 }16                 17                 if(flag)18                 {19                     break;20                 }21             }22         }23         24         return result;25     }