1_Two Sum

记录第一个LeetCode题, c++的STL库不会用, (╥╯^╰╥)

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

1_Two Sum

原文：https://www.cnblogs.com/hesper/p/10386052.html