1、两数之和

直接暴力循环遍历，O(n^2)

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