题解 | #两数之和#

public:
    /**
     * 
     * @param numbers int整型vector 
     * @param target int整型 
     * @return int整型vector
     */
    vector<int> twoSum(vector<int>& numbers, int target) {
        // write code here
        map<int, int> numTable;
        vector<int> res = {0, 0};
        for(int i=0; i<numbers.size(); i++){
            if(numTable.find(numbers[i]) != numTable.end()){
                res = {numTable[numbers[i]]+1, i+1};
                break;
            }
            else{
                numTable[target-numbers[i]] = i;
            }
        }
        return res;
    }
};