Java里String.split需要注意的用法

我們常常用String的split()方法去分割字符串，有兩個地方值得注意：

 

1. 當分隔符是句號時(".")，需要轉義：

由於String.split是基於正則表達式來分割字符串，而句號在正則表達式里表示任意字符。

//Wrong:
//String[] words = tmp.split(".");

//Correct:
String[] words = tmp.split("\\.");

所以，假設分隔符在正則表達式里有一定的意義時，需要格外留心，必須將它們轉義才能達到分割的效果。

 

2. 假設字符串最后有連續多個分隔符，且這些分隔符都需要被分割的話，需要調用split(String regex,int limit)這個方法：

String abc = "a,b,c,,,";
String[] str = abc.split(",");
        
System.out.println(Arrays.toString(str)+" "+str.length);
        
String[] str2 = abc.split(",",-1);
        
System.out.println(Arrays.toString(str2)+" "+str2.length);

輸出如下：

[a, b, c] 3
[a, b, c, , , ] 6

需要輸出csv文件的時候，尤其需要注意。

 

3. 假設需要快速分割字符串，split()並不是最有效的方法。在split()方法內，有如下的實現：

public String[] split(String regex, int limit) {
      return Pattern.compile(regex).split(this, limit);
}

頻繁調用split()會不斷創建Pattern這個對象，因此可以這樣去實現，減少Pattern的創建：

//create the Pattern object outside the loop    
Pattern pattern = Pattern.compile(" ");

for (int i = 0; i < 1000000; i++)
{
    String[] split = pattern.split("Hello World", 0);
    list.add(split);
}

另外split()也往往比indexOf()+subString()這個組合分割字符串要稍慢，詳情可看這個帖子。

我在本機做過測試，感覺indexOf()+subString()比split()快一倍：

public static void main(String[] args) {
        StringBuilder sb = new StringBuilder();
        for (int i = 100000; i < 100000 + 60; i++)
            sb.append(i).append(' ');
        String sample = sb.toString();

        int runs = 100000;
        for (int i = 0; i < 5; i++) {
            {
                long start = System.nanoTime();
                for (int r = 0; r < runs; r++) {
                    StringTokenizer st = new StringTokenizer(sample);
                    List<String> list = new ArrayList<String>();
                    while (st.hasMoreTokens())
                        list.add(st.nextToken());
                }
                long time = System.nanoTime() - start;
                System.out.printf("StringTokenizer took an average of %.1f us%n", time / runs
                        / 1000.0);
            }
            {
                long start = System.nanoTime();
                Pattern spacePattern = Pattern.compile(" ");
                for (int r = 0; r < runs; r++) {
                    List<String> list = Arrays.asList(spacePattern.split(sample, 0));
                }
                long time = System.nanoTime() - start;
                System.out.printf("Pattern.split took an average of %.1f us%n", time / runs
                        / 1000.0);
            }
            {
                long start = System.nanoTime();
                for (int r = 0; r < runs; r++) {
                    List<String> list = new ArrayList<String>();
                    int pos = 0, end;
                    while ((end = sample.indexOf(' ', pos)) >= 0) {
                        list.add(sample.substring(pos, end));
                        pos = end + 1;
                    }
                }
                long time = System.nanoTime() - start;
                System.out
                        .printf("indexOf loop took an average of %.1f us%n", time / runs / 1000.0);
            }
        }
    }

在jdk1.7測試后，結果如下：

StringTokenizer took an average of 7.2 us
Pattern.split took an average of 7.9 us
indexOf loop took an average of 3.5 us

------------------------------------------
StringTokenizer took an average of 6.8 us
Pattern.split took an average of 5.4 us
indexOf loop took an average of 3.1 us

------------------------------------------
StringTokenizer took an average of 6.0 us
Pattern.split took an average of 5.5 us
indexOf loop took an average of 3.1 us

------------------------------------------
StringTokenizer took an average of 5.9 us
Pattern.split took an average of 5.5 us
indexOf loop took an average of 3.1 us

------------------------------------------
StringTokenizer took an average of 6.4 us
Pattern.split took an average of 5.5 us
indexOf loop took an average of 3.2 us

 

本文完