c++对字符串进行切割

对inputstring进行切割,切分标志为字符串c,统计每种子串出现的次数,返回一个map对象。

map<string, int> split(string inputstring, string c) {
    vector<string> result;
    map<string, int> temp_map;
    string::size_type pos1 = 0, pos2 = 0;
    string temp;
    while (pos2 < inputstring.size()) {
        pos2 = inputstring.find(c, pos2);
        if (pos2 == -1) {
            while (pos1 <inputstring.size()) {
                if (isalpha(inputstring[pos1]))
                    temp += tolower(inputstring[pos1]);
                pos1++;
            }
            if (temp.size())
                temp_map[temp] ++;
            break;
        }
        while (pos1 <pos2) {
            if (isalpha(inputstring[pos1]))
                temp += tolower(inputstring[pos1]);
            pos1++;
        }
        pos2 += c.size();
        if (temp.size())
            temp_map[temp] ++;
        result.push_back(temp);
        temp = "";
        pos1 = pos2;
    }
    return temp_map;
}

对一个对inputstring进行切割,切分标志为字符串c,将对应的字符串转化为int型列表返回。

vector<int> split(string inputstring, string c) {
    vector<int> result;
    vector<string> temp_map;
    string::size_type pos1 = 0, pos2 = 0;
    string temp;
    while (pos2 < inputstring.size()) {
        pos2 = inputstring.find(c, pos2);
        if (pos2 == -1) {
            while (pos1 <inputstring.size()) {
                if (isalnum(inputstring[pos1]))
                    temp += tolower(inputstring[pos1]);
                pos1++;
            }
            if (temp.size())
                temp_map.push_back(temp);
            break;
        }
        while (pos1 <pos2) {
            if (isalnum(inputstring[pos1]))
                temp += tolower(inputstring[pos1]);
            pos1++;
        }
        pos2 += c.size();
        if (temp.size())
            temp_map.push_back(temp);
        //result.push_back(temp);
        temp = "";
        pos1 = pos2;
    }
    for (vector<string>::size_type it = 0; it <temp_map.size(); it++) {
        result.push_back(atoi(temp_map[it].c_str()));
    }
    return result;
}

对一个对inputstring进行切割,切分标志为字符串c,返回切分后的子串列表。

vector<int> split(string inputstring, string c) {
    vector<int> result;
    vector<string> temp_map;
    string::size_type pos1 = 0, pos2 = 0;
    string temp;
    while (pos2 < inputstring.size()) {
        pos2 = inputstring.find(c, pos2);
        if (pos2 == -1) {
            while (pos1 <inputstring.size()) {
                if (isalnum(inputstring[pos1]))
                    temp += tolower(inputstring[pos1]);
                pos1++;
            }
            if (temp.size())
                temp_map.push_back(temp);
            break;
        }
        while (pos1 <pos2) {
            if (isalnum(inputstring[pos1]))
                temp += tolower(inputstring[pos1]);
            pos1++;
        }
        pos2 += c.size();
        if (temp.size())
            temp_map.push_back(temp);
        //result.push_back(temp);
        temp = "";
        pos1 = pos2;
    }

    return temp_map;
}
  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值