Arrays.sort 不区分字母大小写 排序

import   java.util.*;  
   
  public   class   Test   implements   Comparator   {  
  public   static   void   main(String   args[])   {  
  ArrayList   list   =   new   ArrayList();  
  list.add("Big");  
  list.add("Dog");  
  list.add("applet");  
  list.add("bee");  
  list.add("dig");  
   
  Collections.sort(list,   new   Test());  
   
  for   (int   i   =   0;   i   <   list.size();   i++)  
  System.out.println(list.get(i));  
  }  
   
  public   int   compare(Object   o1,   Object   o2)   {  
  String   str1   =   o1.toString().toUpperCase();  
  String   str2   =   o2.toString().toUpperCase();  
  return   str1.compareTo(str2);  
  }  
   
  }

------------------------------------------------------

CompClass.java
// A class that implements Comparable
package c08.newcollections;
import java.util.*;
public class CompClass implements Comparable {
  private int i;
  public CompClass(int ii) { i = ii; }
  public int compareTo(Object o) {
  // Implicitly tests for correct type:
  int argi = ((CompClass)o).i;
  if(i == argi) return 0;
  if(i return 1;}

  public static void print(Object[] a) {

    for(int i = 0; iSystem.out.print(a[i] + " ");

      System.out.println();

  }

  public String toString() {

     return i + "";

   }

  public static void main(String[] args) {

      CompClass[] a = new CompClass[20];

      for(int i = 0; ia[i] = new CompClass((int)(Math.random() *100));

      print(a);

      Arrays.sort(a);

     print(a);

     int loc = Arrays.binarySearch(a, a[3]);

     System.out.println("Location of " + a[3] +" = " + loc);

  }

} ///

原文地址:https://www.cnblogs.com/cy163/p/1450274.html