LeetCode-1

 1 vector<int> twoSum(vector<int>& nums, int target) {
 2         vector<int> returnVector;
 3                 
 4         for (vector<int>::size_type i = 0; i < nums.size(); ++i)
 5         {
 6             for (vector<int>::size_type j = i + 1; j < nums.size(); ++j)
 7             {
 8                 if (target == nums[i] + nums[j])
 9                 {
10                     returnVector.push_back(i);
11                     returnVector.push_back(j);
12                     return returnVector;
13                 }
14             }   
15         }
16         
17         return returnVector;
18     }