zoukankan      html  css  js  c++  java
  • string匹配(字符串)

    View Code
        string result;
        string str = "uid=1000012(as) gid=1000000(domain users) groups=1000000(domain users),1000015(ABD/users),1000015(ABD/s)";
        int cur_pos = 0;
        int left_pos = 0;
        int right_pos = 0;
        int offset = 0;
    
        while(1)
        {
            left_pos = str.find('(',cur_pos);
            right_pos = str.find(')',cur_pos);
    
            if(left_pos == -1 || right_pos == -1)
                break;
    
            cur_pos = left_pos + 1;
            offset = right_pos - left_pos - 1;
    
            result = str.substr(cur_pos,offset);
            printf("%s\n",result.c_str());
            cur_pos = right_pos +1;
        }
  • 相关阅读:
    杭电 1013 Digital Roots
    杭电 1040 As Easy As A+B 【排序】
    杭电 2092 整数解
    bzoj3223
    bzoj3224
    LA3905
    bzoj3601
    bzoj1002
    bzoj3105
    bzoj3332
  • 原文地址:https://www.cnblogs.com/guyan/p/2610206.html
Copyright © 2011-2022 走看看