解决输入问题

import java.util.Arrays;
import java.util.Scanner;

public class Main {
    public static void main(String[] args){
        Scanner in=new Scanner(System.in);
        String str=in.nextLine();
        StringBuilder sb=new StringBuilder();
//        for (int i = 0; i <str.length() ; i++) {
//            if (str.charAt(i)>='0'&&str.charAt(i)<='9'){
//                sb.append(str.charAt(i));
//            }
//        }
//
//        System.out.println(sb);

        String[] strs=str.split(",");
        for (int l = 0; l <strs.length ; l++) {
            for (int i = 0; i < strs[l].length(); i++) {
                if ((strs[l].charAt(i) >= '0' && strs[l].charAt(i) <= '9'||(strs[l].charAt(i)=='-'))) {//判断-号否则负数无法判断
                    sb.append(strs[l].charAt(i));
                }

            }
            String a1=sb.toString();
            strs[l]=a1;
            String a2="";
            sb=new StringBuilder(a2);

        }

        int[] a=new int[strs.length];
        int[] temp=new int[str.length()];
        for(int i=0;i<strs.length;i++){
            a[i]=Integer.parseInt(strs[i]);
        }
        fen(a,0,a.length-1,temp);
        System.out.println(Arrays.toString(a));

    }
    public static void fen(int[]a,int left,int right,int[]temp){
        if(left<right){
            int mid=(left+right)/2;
            int midValue=a[mid];
            //向左递归
            fen(a,left,mid,temp);
            //向右递归
            fen(a,mid+1,right,temp);
            //合
            he(a,left,mid,right,temp);
        }
    }
    public static void he(int []a,int left,int mid,int right,int []temp){
        int i=left;
        int j=mid+1;
        int t=0;
        while(i<=mid&&j<=right){
            if(a[i]>a[j]){
                temp[t]=a[j];
                j++;
                t++;
            }else{
                temp[t]=a[i];
                i++;
                t++;
            }
        }
        while(i<=mid){
            temp[t]=a[i];
            t++;
            i++;
        }
        while(j<=right){
            temp[t]=a[j];
            t++;
            j++;
        }
        //放入完成后
        t=0;
        int templeft=left;
        int index=0;
        while(templeft<=right){
            a[templeft]=temp[t];
            templeft++;
            t++;
        }
    }
}