zoukankan      html  css  js  c++  java
  • scala之split()函数用法

    split()函数:

    def split(arg0: String): Array[String]
    def split(arg0: String, arg1: Int): Array[String]

    scala> "a-b-c-d-e".split("-",3)
    res0: Array[String] = Array(a, b, c-d-e)

    scala> "a-b-c-d-e".split("-",4)
    res1: Array[String] = Array(a, b, c, d-e)

    scala> "a-b-c-d-e".split("-",5)
    res2: Array[String] = Array(a, b, c, d, e)

    scala> "a-b-c-d-e".split("-",6)
    res3: Array[String] = Array(a, b, c, d, e)


    scala> "a-b-c-d-e".split("-")
    res6: Array[String] = Array(a, b, c, d, e)


    scala> "a-b-c-d--e---".split("-")
    res7: Array[String] = Array(a, b, c, d, "", e)

    //arg1=0,split函数尽可能多的匹配arg0,不保留处于末尾位置的空字符串,空字符串例外。比如:
    scala> "--a-b-c-d--e---".split("-")
    res8: Array[String] = Array("", "", a, b, c, d, "", e)
    scala> "".split("-",0)
    res1: Array[String] = Array("")


    //arg1<0,保留末尾的空字符串
    scala> "--a-b-c-d--e---".split("-",-1)
    res0: Array[String] = Array("", "", a, b, c, d, "", e, "", "", "")





  • 相关阅读:
    线段树----hdoj 1754 I here it
    树状数组----poj 2352 stars
    莫队算法
    枚举+深搜----poj 3279 Fliptile
    java 10 -09的作业
    java 09 06 thread-同步代码块-同步方法
    java09-05 join_daemon
    java09 02 Thread-yield 放弃
    java 07 jar
    java 08 作业
  • 原文地址:https://www.cnblogs.com/fulse/p/7855939.html
Copyright © 2011-2022 走看看