/**
* Sort an array of strings in reverse order.
*/
package StrRegex;
import java.util.*;
/**
* Create a comparator that returns the outcome
* of a reverse string comparison.
*/
class RevStrComp implements Comparator< String > {
/**
* Implement the compare() method so that it
* reverses the order of the string comparison.
*/
public int compare(String strA, String strB) {
// Compare strB to strA, rather than strA to strB.
return strB.compareTo(strA);
}
}
/**
* Demonstrate the reverse string comparator.
*/
public class RevStrSort {
/**
* @param args
*/
public static void main(String[] args) {
// Create a sample array of strings.
String strs[] = { "dog", "horse", "zebra", "cow", "cat" };
// Show the initial order.
System.out.print("Initial order : ");
for (String s : strs) {
System.out.print(s + " ");
}
System.out.println("\n");
// Sort the array in reverse order.
// Begin by creating a reverse string comparator.
RevStrComp rsc = new RevStrComp();
// Now, sort the strings using the reverse comparator.
Arrays.sort(strs, rsc);
// Show the reverse sorted order.
System.out.print("Sorted in reverse order : ");
for (String s : strs) {
System.out.print(s + " ");
}
System.out.println("\n");
// For comparison, sort the strings in natural order.
Arrays.sort(strs);
// Show the natural sorted order.
System.out.print("Sorted in natural order : ");
for (String s : strs) {
System.out.print(s + " ");
}
System.out.println("\n");
}
}
RevStrSort
最新推荐文章于 2023-05-09 20:06:54 发布