LeetCode之Two Sum

http://oj.leetcode.com/problems/two-sum/

一开始三次WA的原因有如下几点：

1. 没有看清   Please note that your returned answers (both index1 and index2) are not zero-based. 这个只是指 Zero-based array

2. 上一条错误的理解成了 都是大于0的，因此错过了 [0,1,2,0],0 这种testcase

class Solution {
public:
    vector
   
   
    
     twoSum(vector
    
    
     
      &numbers, int target) {
        vector
     
     
      
       result;
        for(int i = 0; i < numbers.size()-1; i++) 
            for(int j = i+1; j < numbers.size(); j++) {
                if(numbers[i] + numbers[j] == target) {
                    result.push_back(i+1);
                    result.push_back(j+1);
                }
            }
        return result;
    }
};