leetcode Algorithms 1. Two Sum

题意：简单的找nums[i]+nums[j]==target

思路：标记，set，O(nlogn)

           暴力 O(n*n)

class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        multiset<int>s;
        vector<int>ans;
        for(int i=0;i<nums.size();i++)
        {
            s.insert(nums[i]);
        }
        for(int i=0;i<nums.size();i++)
        {
            s.erase(s.find(nums[i]));
            if(s.find(target-nums[i])!=s.end())
            {
                ans.push_back(i);
                for(int j=i+1;j<nums.size();j++)
                {
                    if(nums[j]==target-nums[i])
                    {
                        ans.push_back(j);
                        break;
                    }
                }
                return ans;
            }
            s.insert(nums[i]);
        }
    }
};