LeetCode 1. 两数之和

#include <iostream>
#include <cstring>
#include <string>
#include <algorithm>
#include <vector>
using namespace std;

/*
* 思路：暴力解法，固定一个数字，再继续查找相减的结果
*/
class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        vector<int>res;
        for (int i = 0; i < nums.size(); i++)
        {
            for (int j = i + 1; j < nums.size(); j++)
            {
                if (target - nums[i] == nums[j])
                {
                    res.push_back(i);
                    res.push_back(j);
                    return res;
                }
            }
        }
        return res;
    }
};

int main()
{
    int x, data, target;
    cin >> x;
    vector<int>num;
    for (int i = 0; i < x; i++)
    {
        cin >> data;
        num.push_back(data);
    }
    cin >> target;
    Solution A;
    vector<int>res = A.twoSum(num, target);
    cout << res[0] << " " << res[1] << endl;
}