codesandbox链接
interface Comparable<T> {
compareTo(that: T): number;
equals(that: T): boolean;
}
function selectionSort<E extends Comparable<E> | number | string>(
arr: E[]
): E[] {
if (!arr.length) return arr;
if (typeof arr[0] === "number" || typeof arr[0] === "string") {
for (let i = 0; i < arr.length; i++) {
let minIndex = 0;
for (let j = i; j < arr.length; j++) {
if (arr[j] < arr[minIndex]) {
minIndex = j;
}
}
const temp = arr[i];
arr[i] = arr[minIndex];
arr[minIndex] = temp;
}
} else {
arr = arr as Comparable<any>[]
for (let i = 0; i < arr.length; i++) {
let minIndex = 0;
for (let j = i; j < arr.length; j++) {
if (arr[j].compareTo(arr[minIndex]) < 0) {
minIndex = j;
}
}
const temp = arr[i];
arr[i] = arr[minIndex];
arr[minIndex] = temp;
}
}
return arr;
}
class Student implements Comparable<Student> {
constructor(private score: number) {}
compareTo(that: Student): number {
return this.score - that.score;
}
equals(that: Student): boolean {
return this.score === that.score;
}
}
selectionSort<Student>([new Student(1)]);
selectionSort<number>([1, 2, 3]);
selectionSort<string>(["1", "2", "3"]);
与恶龙缠斗过久,自身亦成为恶龙;凝视深渊过久,深渊将回以凝视…