Code Test - LoneWolfL/LeetCode GitHub Wiki

This is a test!

#include<stdio>

#include<stdio>
using namespace std;

#include<stdio>
using namespace std;

#include<stdio>

An new test.

#include <bits/stdc++.h>

using namespace std;

class Solution
{
public:
    vector<int> twoSum(vector<int>& nums, int target)
    {
        vector<int> res(2);//as return.
        map<int,int> indices;
        for (int i=0;i<nums.size();i++)
        {
            if (indices.count(target-nums[i])!=0)
            {
                res[0]=indices[target-nums[i]];
                res[1]=i;
                break;
            }
            indices.insert(make_pair(nums[i],i));
        }
        return res;
    }
};

int main()
{
    Solution TwoSum;
    //input
    int Target;
    vector<int> Nums;
    cin>>Target;
    int tmp;
    while (cin>>tmp)
        Nums.push_back(tmp);
    //calculate
    vector<int> ans;
    ans=TwoSum.twoSum(Nums,Target);
    //output
    for (size_t i=0;i<ans.size();i++)
        cout<<ans[i]<<' ';
}

1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
An new test.
This is a test

An new test.
This is a test!

⚠️ **GitHub.com Fallback** ⚠️