实现字符串分割算法 JAVA_开发JAVA编程中字符串分割的两种方法

方法1:采用String的split,验证代码如下:

import java.util.Arrays;

public class TestSplit {

public static void main(String[] args) {

String orignString = new String("5,8,7,4,3,9,1");

String[] testString = orignString.split(",");

int[] test = { 0, 0, 0, 0, 0, 0, 0 };

//String to int

for (int i = 0; i < testString.length; i++) {

test[i] = Integer.parseInt(testString[i]);

}

//sort

Arrays.sort(test);

//asc sort

for (int j = 0; j < test.length; j++) {

System.out.println(test[j]);

}

System.out.println("next ");

//  desc

for (int i = (test.length - 1); i >= 0; i--) {

System.out.println(test[i]);

}

}

}

方法2:采用StringTokenizer

import java.util.Arrays;

import java.util.StringTokenizer;

public class SplitStringTest {

public static void main(String[] args) {

String s = new String("5,8,7,4,3,9,1");

int length = s.length();

//split   s with ","

StringTokenizer commaToker = new StringTokenizer(s, ",");

String[] result = new String[commaToker.countTokens()];

int k = 0;

while (commaToker.hasMoreTokens()) {

result[k] = commaToker.nextToken();

k++;

}

int[] a = new int[result.length];

for (int i = 0; i < result.length; i++) {

a[i] = Integer.parseInt(result[i]);

}

//sort

Arrays.sort(a);

//asc sort

for (int j = 0; j < result.length; j++) {

System.out.println(a[j]);

}

}

}


版权声明:本文为weixin_42509847原创文章,遵循CC 4.0 BY-SA版权协议,转载请附上原文出处链接和本声明。