Java Comparator字符排序(数字、字母、中文混合排序)
2023-09-27 14:21:32 时间
Java.lang.Character类 复习一下
这是修正前的排序效果:
这是修正后的排序效果:
完整示例:
以下是排序的部份代码(非全部代码:拼音首字母算法不在其中)
- import java.util.Arrays;
- import java.util.Comparator;
- import java.util.regex.Matcher;
- import java.util.regex.Pattern;
- public class Demo {
- public static void main(String[] args) {
- // TODO Auto-generated method stub
- String fileNames[] = { "fss01", "fss2", "fss01_22", "fss3", "fss1", "fss10", "fss20", "fss4", "fss30", "fss21", "fss12","fss01_3" };
- char chFileNames[][] = new char[fileNames.length][];
- String[] oldSortedNames = new String[fileNames.length];
- for (int i = 0; i < fileNames.length; i++) {
- chFileNames[i] = fileNames[i].toCharArray();
- oldSortedNames[i] = fileNames[i];
- }
- // Arrays.sort(fileNames, StrLogicCmp);
- Arrays.sort(chFileNames, ChsLogicCmp);
- System.out.println("_Random_" + "\t" + "_Tradion_" + "\t" + "_Target_");
- String line;
- for (int i = 0; i < fileNames.length; i++) {
- line = fileNames[i] + (fileNames[i].length() >= 8 ? "\t" : "\t\t");
- line += oldSortedNames[i] + (oldSortedNames[i].length() >= 8 ? "\t" : "\t\t");
- line += new String(chFileNames[i]);
- System.out.println(line);
- }
- }
- static Comparator<String> StrLogicCmp = new Comparator<String>() {
- @Override
- public int compare(String o1, String o2) {
- // TODO Auto-generated method stub
- return 0;
- }
- };
- // "f01s2s22", "f1s02s2"
- static Comparator<char[]> ChsLogicCmp = new Comparator<char[]>() {
- class Int{
- public int i;
- }
- public int findDigitEnd(char[] arrChar, Int at) {
- int k = at.i;
- char c = arrChar[k];
- boolean bFirstZero = (c == '0');
- while (k < arrChar.length) {
- c = arrChar[k];
- //first non-digit which is a high chance.
- if (c > '9' || c < '0') {
- break;
- }
- else if (bFirstZero && c == '0') {
- at.i++;
- }
- k++;
- }
- return k;
- }
- @Override
- public int compare(char[] a, char[] b) {
- if(a != null || b != null){
- Int aNonzeroIndex = new Int();
- Int bNonzeroIndex = new Int();
- int aIndex = 0, bIndex = 0,
- aComparedUnitTailIndex, bComparedUnitTailIndex;
- // Pattern pattern = Pattern.compile("D*(d+)D*");
- // Matcher matcher1 = pattern.matcher(a);
- // Matcher matcher2 = pattern.matcher(b);
- // if(matcher1.find() && matcher2.find()) {
- // String s1 = matcher1.group(1);
- // String s2 = matcher2.group(1);
- // }
- while(aIndex < a.length && bIndex < b.length){
- //aIndex <
- aNonzeroIndex.i = aIndex;
- bNonzeroIndex.i = bIndex;
- aComparedUnitTailIndex = findDigitEnd(a, aNonzeroIndex);
- bComparedUnitTailIndex = findDigitEnd(b, bNonzeroIndex);
- //compare by number
- if (aComparedUnitTailIndex > aIndex && bComparedUnitTailIndex > bIndex)
- {
- int aDigitIndex = aNonzeroIndex.i;
- int bDigitIndex = bNonzeroIndex.i;
- int aDigit = aComparedUnitTailIndex - aDigitIndex;
- int bDigit = bComparedUnitTailIndex - bDigitIndex;
- //compare by digit
- if(aDigit != bDigit)
- return aDigit - bDigit;
- //the number of their digit is same.
- while (aDigitIndex < aComparedUnitTailIndex){
- if (a[aDigitIndex] != b[bDigitIndex])
- return a[aDigitIndex] - b[bDigitIndex];
- aDigitIndex++;
- bDigitIndex++;
- }
- //if they are equal compared by number, compare the number of '0' when start with "0"
- //ps note: paNonZero and pbNonZero can be added the above loop "while", but it is changed meanwhile.
- //so, the following comparsion is ok.
- aDigit = aNonzeroIndex.i - aIndex;
- bDigit = bNonzeroIndex.i - bIndex;
- if (aDigit != bDigit)
- return aDigit - bDigit;
- aIndex = aComparedUnitTailIndex;
- bIndex = bComparedUnitTailIndex;
- }else{
- if (a[aIndex] != b[bIndex])
- return a[aIndex] - b[bIndex];
- aIndex++;
- bIndex++;
- }
- }
- }
- return a.length - b.length;
- }
- };
- }
2021-11-23更新算法--排序时不区分字母大小写
这是之前的算法:
更新后的效果:
相关文章
- 深入解析Java重写 - 返回值、修饰符必须一致?
- java中快读快写
- java中父类与子类, 不同的两个类中的因为构造函数由于递归调用导致栈溢出问题
- Java反射-修改String常量
- Java 按字节获得字符串(中文)长度
- Java-JVM OutOfMemory 情况(JDK8)
- 【Java】实现一个根据日期判断星座程序的编写
- Java精选笔记_JSP开发模型
- java为什么使用TypeReference
- 【组合模式 实战(1)——实现 五子棋(Java、附代码)】
- java压缩zip文件中文乱码问题
- Windows下命令行及Java+Tesseract-OCR对图像进行(字母+数字+中文)识别,亲测可行
- Java有向无权图的单源点最短路径-邻接矩阵和邻接表
- java设计优化--装饰者模式
- 【Java】Appache Flume 中文介绍
- 【Java AWT 图形界面编程】Container 容器 ② ( Frame 窗口示例 | Panel 示例 | 窗口中文乱码处理 )
- centos java tomcat 中文乱码解决办法
- java判断中文字符串长度
- 最新版-Python和Java实现Aes相互加解密
- 【除数博弈(1025-java)】
- 三、Java基础知识2