实现一个算法对多个字符串进行排序,不能使用现有的类,在排序中,字符串“Bc”,“Ad”,“aC”,“Hello”,“Xman”,“little”,“During”,“day”能够排序成“Ad”,“aC”,“Bc”,“During”,“day”,“Hello”,“little”,“Xman”,也就是说,在排序的过程中并不是传统的按照字符串排序,在排序中海需要将小写字母一并排序,也就是说a字符串要在B和b之前
package com.hhm.wo;
import java.util.Arrays;public class Test5 {
public static void main(String[] args) {
String[] s = { "Bc", "Ad", "aC", "Hello", "Xman", "little", "During",
"day" };
System.out.println("Before sort: " + Arrays.toString(s));
sort(s);
System.out.println("After sort: " + Arrays.toString(s));
}
public static int compare(String s1, String s2) {
char[] arr1 = s1.toCharArray(), arr2 = s2.toCharArray();
int index = 0, len1 = arr1.length, len2 = arr2.length;
int len = len1 < len2 ? len1 : len2;
while (index < len) {
char c1 = arr1[index], c2 = arr2[index];
char c1_ = (char) (c1 >= 'a' ? c1 - ('a' - 'A') : c1);
char c2_ = (char) (c2 >= 'a' ? c2 - ('a' - 'A') : c2);
if (c1_ == c2_) {
if (c1 != c2)
return c1 - c2;
} else
return c1_ - c2_;
index++;
}
if (len1 == len2)
return 0;
else if (len1 > len2)
return 1;
else
return -1;
}
public static void sort(String[] src) {
String temp;
for (int i = 0; i < src.length - 1; i++) {
for (int j = 0; j < src.length - i - 1; j++) {
if (compare(src[j], src[j + 1]) > 0) {
temp = src[j];
src[j] = src[j + 1];
src[j + 1] = temp;
}
}
}
}
}