现在输入n个数字，以逗号，分开；然后可选择升或者降序排序；按提交键就在另一页面显示按什么排序，结果为，提供reset

package test;

import java.io.BufferedInputStream;
import java.io.DataInputStream;
import java.util.Arrays;

//1．现在输入n个数字，以逗号，分开；然后可选择升或者降序排序；
//2. 按提交键就在另一页面显示按什么排序，结果为，提供reset
public class test01 {
public static void main(String[] args) {
System.out.println("请输入n个数字，以逗号，分开");
String str = "";
try {
str = new DataInputStream(new BufferedInputStream(System.in)).readLine();
while (str.length() < 1) {
System.out.println("请输入n个数字，以逗号，分开");
str = new DataInputStream(new BufferedInputStream(System.in)).readLine();
}
} catch (Exception e) {
e.printStackTrace();
}

int[] orgin;
try {
orgin = myArray.toArray(str);
} catch (Exception e) {
System.out.println("输入的数组出错，无法把字符串转为数组！");
return;
}

String order = "";// 这个是输入的命令判断
System.out.println("升序输入：A，降序输入：D");

DataInputStream in = new DataInputStream(new BufferedInputStream(System.in));
try {
order = in.readLine().toLowerCase();
while (!order.equals("a") && !order.equals("d")) {
System.out.println("请输入A(升序)或D(降序)");
order = new DataInputStream(new BufferedInputStream(System.in)).readLine().toLowerCase();
}
} catch (Exception e) {
e.printStackTrace();
}

// 升
if (order.equals("a")) {
System.out.println("您输入的数组是：");
System.out.println(str);
int[] result = myArray.toAesc(orgin);
System.out.println("升序的数组是：");
for (int i = 0; i < result.length; i++) {
if (i == (result.length - 1)) {
System.out.println(result[i]);
} else {
System.out.print(result[i] + ",");
}
}
}

// 降
if (order.equals("d")) {
System.out.println("您输入的数组是：");
System.out.println(str);
int[] result = myArray.toDesc(orgin);
System.out.println("降序的数组是：");
for (int i = 0; i < result.length; i++) {
if (i == (result.length - 1)) {
System.out.println(result[i]);
} else {
System.out.print(result[i] + ",");
}
}
}
}

}

class myArray {
public static int[] toArray(String str) {
String[] str1 = str.split(",");
int len = str1.length;
int[] int1 = new int[len];
for (int j = 0; j < len; j++) {
int1[j] = Integer.parseInt(str1[j]);
}
return int1;
}

public static int[] toDesc(int[] myint) {
// 这里进行排序 降序
for (int i = 0; i < myint.length; i++) {
for (int j = i; j < myint.length; j++) {
if (myint[i] < myint[j]) {
int temp = myint[i];
myint[i] = myint[j];
myint[j] = temp;
}
}

}
return myint;
}

public static int[] toAesc(int[] myint) {
//冒泡排序 升序
for (int i = 0; i < myint.length - 1; i++) {
for (int j = 0; j < myint.length - i - 1; j++) {
if (myint[j] > myint[j + 1]) {// 降序 如果变成 myint[j] > myint[ j + 1]就成了升序
int temp = myint[j + 1];
myint[j + 1] = myint[j];
myint[j] = temp;
}
}
}
//		Arrays.sort(myint);
return myint;
}
}