力扣（LeetCode）试题1-两数之和 C++代码

这种“暴力匹配”算法还是慢，再学习新的方法之后，再来更新这部分代码吧。

#include <iostream>
#include <vector>
using namespace std;

class Solution {
public:
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        vector<int> index;
        for (int i = 0; i<nums.size(); i++){
            for (int j = i + 1; j<nums.size(); j++){
                if (nums[i] + nums[j] == target){
                    index.push_back(i);
                    index.push_back(j);
                }
                else
                    continue;
            }
        }
        return index;
    }
};
int main(){
    Solution sol;
    int n;
    vector<int> out;
    vector<int> nums = { 3,2,3 };
    int target = 6;
    out = sol.twoSum(nums, target);
    for (auto i:out)
        cout << i << endl;
    cin >> n;
    return 0;
}