华为OJ 初级：在字符串中找出连续最长的数字串

import java.util.Scanner;

public class Main{
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		String input = sc.next();
		int[] result = new int[input.length()];
		sc.close();
		for (int i = 0; i < input.length(); i++) {
			if (input.charAt(i) >= 0 && input.charAt(i) <= 9) { //遍历判断是否是数字
				int length = 0;
				for (; i < input.length(); i++) { //如果是数字，从这个位置开始往后面遍历
					if (input.charAt(i) >= 0 && input.charAt(i) <= 9) {
						length++;  //当是数字的时候，长度+1
					} else {
						break;  //否则终断遍历
					}
					result[i] = length;  //i为数字串结束的位置，length为数字串长度
				}
			}
		}

		int length = 0;
		int temp = 0;
		for (int i = 0; i < result.length; i++) {
			if (result[i] >= length) {
				length = result[i];  //找出最长的数字串和其终点位置
				temp = i;
			}
		}
		if (length == 0)
			System.out.println(0);
		else {
			String output = input.substring(temp - length + 1, temp + 1);
			System.out.println(output + "," + length);
		}
	}
	
	//方法二：使用split配合正则表达式，将字符串分隔成只含有数字的数组，此方法只适合输入字符串只含有字符和数字
	private static void find(String input){
		String[] string = input.split("[a-zA-Z]");
		String temp = null;
		int length = 0;
		for(int i = 0; i < string.length; i++){
			if(length <= string[i].length()){
				length = string[i].length();
				temp = string[i];
			}
		}
		if(string.length == 0)
			System.out.println(0);
		else
			System.out.println(temp + "," + length);
	}
}