//題目：把學生鏈表按照學號從大到小排序

package Basic50;

import java.util.ArrayList;

public class ArraySort
{
public static class Student//創建學生類（內部類）
{
public int xuehao;
public String name;
public boolean sex;
public Student(int xuehao, String name, boolean sex)
{
super();
this.xuehao = xuehao;
this.name = name;
this.sex = sex;
}

@Override
public String toString()
{
return "Student [xuehao=" + xuehao + ", name=" + name + ", sex=" + sex + "]";
}

public Student()
{
super();
// TODO Auto-generated constructor stub
}
}



public static void main(String[] args)//main方法
{
Student s1 = new Student(22, "li", false);//輸入學生信息
Student s2 = new Student(5, "cheng", false);
Student s3 = new Student(4, "sun", true);
Student s4 = new Student(39, "李三", true);
Student s5 = new Student(10, "王五", true);
Student s6 = new Student(12, "張柳", true);

ArrayList a1 = new ArrayList();// 創建原始學生鏈表
ArrayList a2 = new ArrayList();// 創建排序後的學生鏈表

a1.add(s1);// 原始學生鏈表取得數據
a1.add(s2);
a1.add(s3);
a1.add(s4);
a1.add(s5);
a1.add(s6);

Student temp1 = new Student();// 創建兩個用於臨時存放的學生類型
Student temp2 = new Student();

for (int i = 0; i < a1.size(); i++)
{
for (int k = 0; k < a1.size(); k++)
{

temp1 = (Student) a1.get(i);// 取得原始學生鏈表的第i個學生數據
temp2 = (Student) a1.get(k);// 取得原始學生鏈表的第k個學生數據

if (temp2.xuehao > temp1.xuehao)
{
break;// 如果第i個學生學號不是最大，i++
}
if (k == (a1.size() - 1))// 如果k已經是原始鏈表最後一個，說明第i個是學號最大的
{
a2.add(temp1);
a1.remove(i);
i = -1;// 去掉第i個學生後重新比較
}

}

}

for (int i = 0; i < a2.size(); i++)// 按順序打印
{
System.out.println(a2.get(i));
}
System.out.println("exit");

}

}

Java基礎練習-數組鏈表排序