leetcode练习题 two-sum

解题思路

简单遍历数组

代码

class Solution {
public:
    vector<int> twoSum(vector<int> &numbers, int target) {
        vector<int>res;
        bool flag = false;
        for(int k = 0;k < numbers.size();k++){
            for(int j = k + 1;j < numbers.size();j++){
                if(numbers[k] + numbers[j] == target){
                    res.push_back(k + 1);
                    res.push_back(j + 1);
                    flag = true;
                    break;
                }
            }
            if(flag == true)
                break;
        }
        return res;
    }
};