LeetCode第一题完整代码

含输入文本处理，数字提取，结果计算。

#include
#include 
#include 
#include
using namespace std;
 
class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        unordered_map<int, int> map;
        for (int i = 0; i < nums.size(); ++i) {
            int num = target - nums[i];
            if (map.find(num) != map.end()) {
                return {map[num], i};
            }map[nums[i]] = i;
        }return {};
    }
};
 
vector<int> split(string str, string delimeter= " "){
    vector<int> nums;
    string reStr = "[^" + delimeter + "]+"; // splicing regular expressions
    regex re(reStr); //construct regular object
    sregex_iterator word_begin = sregex_iterator(str.begin(),str.end(),re); // get regular iterator points to string start
    sregex_iterator word_end = sregex_iterator(); // get regular iterator points to string end
    for(auto i = word_begin; i != word_end; i++){
            nums.push_back(stoi((*i).str())); //stoi((*i).str())
    }return nums; // distance(word_begin,word_end); // number of split strings
}
 
int main()
{
    vector input(6);
    for(int i=0; i < 6; i++)cin>>input[i];
    int target = stoi(input[5]);
    string str_num = input[2].substr(1, input[2].size()-3);
    vector<int> nums = split(str_num, ",");
    vector<int> result = Solution().twoSum(nums, target);
    cout << result[0] << "," << result[1] << endl;
    return 0;
}
 
/*
input：
nums = [1,2,7,11,15], target = 9
nums = [3,2,4], target = 6
nums = [3,3], target = 6
*/