zoukankan      html  css  js  c++  java
  • .net spit 用法

    C#spit方法

     

    1、用字符串分隔:
    using System.Text.RegularExpressions;

    string str="aaajsbbbjsccc";

    string[] sArray=Regex.Split(str,"js",RegexOptions.IgnoreCase);

    foreach (string i in sArray) Response.Write(i.ToString() + "<br>");

    输出结果:
    aaa
    bbb
    ccc

    2、用多个字符来分隔:

    string str="aaajbbbscccjdddseee";

       string[] sArray=str.Split(new char[]{'j','s'});

    foreach(string i in sArray) Response.Write(i.ToString() + "<br>");

    输出结果:
    aaa
    bbb
    ccc
    ddd
    eee

    3、用单个字符来分隔:

    string str="aaajbbbjccc";

    string[] sArray=str.Split('j');

    foreach(string i in sArray) Response.Write(i.ToString() + "<br>");

    输出结果:
    aaa
    bbb
    ccc

    Split
    重载方法:
            1.public string[] Split(params char[] separator);
            2.public string[] Split(char[] separator, int count);
            3.[ComVisible(false)]
            public string[] Split(char[] separator, StringSplitOptions options);    
            4.[ComVisible(false)]
               public string[] Split(string[] separator, StringSplitOptions options);
            5.[ComVisible(false)]
               public string[] Split(char[] separator, int count, StringSplitOptions options);
            6.[ComVisible(false)]
               public string[] Split(string[] separator, int count, StringSplitOptions options);

            StringSplitOptions options
    :前后有空项时是否返回空项
            
    如:/2008/1/1    ‘/’分割
                   1
    StringSplitOptions.None                                  返回空 2008 1 1
                   2
    StringSplitOptions.RemoveEmptyEntries                    返回 2008 1 1
                      int count
    :返回分割的项目数

  • 相关阅读:
    hdu1003 最大子串和
    cf339d Xenia and Bit Operations
    A + B Problem II
    中国近代史纲要----王洪兵--2016年春季学期----中国海洋大学
    CodeForces 35D Animals
    CodeForces 558D
    Vanya and Brackets
    spfa
    hdu 1217 Arbitrage
    CodeForces 1A Theatre Square
  • 原文地址:https://www.cnblogs.com/kavaol/p/spit.html
Copyright © 2011-2022 走看看