c++ string的trim和split实现

转载自:https://blog.csdn.net/butterfly_dreaming/article/details/10142443#

trim和split在其他语言中都有实现,在C++标准库中没有,下面实现一下:

trim

1.使用string的find_first_not_of,和find_last_not_of方法

#include <iostream>
#include <string>
using namespace std;
string& trim(string &);

int main() {
    string a(" ab cd ");
    cout<<a<<endl;
    cout<<trim(a)<<endl;
    return 0;
}
string& trim(string& s){
    if(s.empty())return s;
    s.erase(0, s.find_first_not_of(' '));
    s.erase(s.find_last_not_of(' ') + 1);
    return s;
}

2.使用boost库中的trim,boost库对提供很多C++标准库没有但是又非常常用和好用的库函数,例如正则表达式,线程库等等。

#include <iostream>
#include <string>
#include <boost/algorithm/string.hpp>
using namespace std;
using namespace boost;
int main() {
    string a(" ab cd ");
    cout<<a<<endl;
    trim(a);
    cout<<a<<endl;
    return 0;
}

split

#include <iostream>
#include <string>
#include <vector>
using namespace std;
void split(string&, string&, vector<string>*);

int main() {
    string a("ab cd");
    vector<string> b;
    string c(" ");
    cout<<a<<endl;
    split(a, c, &b);
    cout<<b[1]<<endl;
    return 0;
}
void split(string& s, string& delim, vector<string>* ret){
    size_t last = 0;
    size_t index = s.find_first_of(delim, last);
    while(index != string::npos){//查找到匹配
        ret->push_back(s.substr(last, index-last));
        last = index + 1;
        index = s.find_first_of(delim, last);
    }
    if(index - last > 0)ret->push_back(s.substr(last, index-last));
}

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
下面代码转化为c++代码 import java.util.*; public class Main { public static void main(String args[]) { Scanner scan = new Scanner(System.in); while (scan.hasNextLine()) { String company = scan.nextLine().trim(); String team = scan.nextLine().trim(); String result = scan.nextLine().trim(); String[] results = result.split(","); System.out.println(getResult(company,team,results)); } } private static String getResult(String company, String team, String[] results) { if(!results[0].equalsIgnoreCase(company) || !results[2].equalsIgnoreCase(team)){ return "Not Found"; } return parseScore(company, team, results[1]); } private static String parseScore(String company, String team, String result) { String[] resultItems = result.split("_"); String people = resultItems[0]; String score = resultItems[1]; String evaluate = resultItems[2]; StringBuilder sb = new StringBuilder(); sb.append(company.toUpperCase()) .append(",").append(people) .append("_").append(score) .append("_").append(convertResult(score,evaluate)) .append(",").append(team); return sb.toString(); } private static String convertResult(String score, String evaluate){ String replace = Integer.parseInt(score.trim()) >= 80 || isTop3(evaluate) ? "perfect" : "better"; int index1 = evaluate.indexOf("{"); int index2 = evaluate.indexOf("}"); return evaluate.substring(0,index1) + replace + evaluate.substring(index2 + 1); } private static boolean isTop3(String evaluate){ String sort = ""; char[] evaluates = evaluate.toCharArray(); for (int i =0; i < evaluates.length; i++){ char temp = evaluates[i]; if(!Character.isDigit(temp)){ break; } sort += Character.toString(temp); } return Integer.parseInt(sort) <= 3; } }
07-20

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值