代码:字符串排序(待修改)

public class StringSort {
    public static void main(String[] args) {
        Scanner input=new Scanner(System.in);
        System.out.println("请输入数组元素长度:");
        int num=input.nextInt();
        System.out.println("请输入字符串:");
        String str[]=new String[num];
        for(int i=0;i<num;i++){
            str[i]=input.next();
        }
        input.close();
        System.out.println("before sorting:");
        int c=0;
        for (int i = 0; i < num; i++) {
            if (str[i].contains(",") || str[i].contains("."))
                c++;
                System.out.println(str[i]);
            }
        for (int i = 0; i < num-1; i++) {
            int min=i;
            for (int j = i+1; j < num; j++) {
                if (str[min].contains(",")&&str[min].contains("."))
                    min=j;
                else if (str[j].compareTo(str[min])<0&&!str[j].contains(",")&&!str[j].contains("."))
                    min=j;
            }
            if (min!=i){
                String t=str[i];
                str[i]=str[min];
                str[min]=t;
            }
        }
        System.out.println("after sorting:");
        for (int i = 0; i < num-c; i++) {
            System.out.println(str[i]);
            System.out.println("invalid items:");
            for ( i = num-c; i < num; i++)
                System.out.println(str[i]);
        }
    }
}

Guess you like

Origin blog.csdn.net/yuanlaishidahuaa/article/details/121169642