leetcode/two-sum

1.暴力破解

#include<iostream>
#include<vector>
using namespace std;
class Solution {
public:
    vector<int> twoSum(vector<int> numbers, int target)
    {
        vector<int> index;
        for (int i=0;i<numbers.size();i++){
            for (int j=(i+1);j<numbers.size();j++){
                if (numbers[i]+numbers[j]==target){
                    index.push_back(i);
                    index.push_back(j);
                }
            }
        }
        return  index;

    }
};

int main(){
    vector<int> nums(11);
    for (int i=1;i<12;i++){
        nums[i-1]=i;
    }
    int target = 11;
    Solution subSolution;

    for(int j=0;j< ((subSolution.twoSum(nums,target).size()+1)/2);j++){
        cout<<"class"<<j+1<<endl;
        cout<<"the First number is:"<<"num"<<subSolution.twoSum(nums,target)[2*j]<<",value is:"<<nums[ subSolution.twoSum(nums,target)[2*j] ]<<endl;
        cout<<"the other number is:"<<"num"<<subSolution.twoSum(nums,target)[2*j+1]<<",value is:"<<nums[ subSolution.twoSum(nums,target)[2*j+1] ]<<endl;
    }
    return 0;
}