herrDeng網內搜尋
自訂搜尋
熱門文章
-
url="https://www.twse.com.tw/exchangeReport/STOCK_DAY?response=json&date=20220330&stockNo=2330"
-
C++ py3 C Rust adjacent difference與loop速解Leetcode 1526 Minimum Number of Increments on Subarrays to Form a Target Array [Py3一行解請進]
-
Py3 C++導出遞迴公式解難題Leetcode1611 Minimum One Bit Operations to Make Integers Zero從導出公式到寫出code，一次完成解Leetcode難題 [C++一行解請進]
-
int a[]={21, 23, 57, 13 ,17, 6}; float average; average=?
-
py3 cpp Line sweep解Leetcode 3346 Maximum Frequency of an Element After Performing Operations I 使用 line sweep不用排序，可得線性解 [Py3解請進]
-
C++ Py3 Euclidean Algorithm解Leetcode 2169 Count Operations to Obtain Zero [Py3一行解請進]
-
教育部為提昇全民資安素養與電腦防護能力，本部於101年9月5日至11月5日舉辦「全民資安素養自我評量」活動，請在活動期間內踴躍上網檢測資訊安全素養認知程度，並有機會參與抽獎，詳情請參閱活動網站（網址： https://isafe.moe.edu.tw/event
1 則留言:
package sorting;
import java.util.Arrays;
import java.util.Comparator;
class studentCA implements Comparator<Student>{
public int compare(Student X1, Student X2){
return X1.A-X2.A;
}
}
public class StudentSort {
public static void main(String[] args) {
Student X[]=new Student[3];
X[0]=new Student(0,"Mary",90 ,85);
X[1]=new Student(1,"John",59 ,65);
X[2]=new Student(2,"Joe",77 ,75);
for(int i=0; i<X.length; i++)
X[i].print();
studentCA CA=new studentCA();
Arrays.sort(X,CA);
System.out.println("=============");
for(int i=0; i<X.length; i++)
X[i].print();
}
}
張貼留言