Java对中文数字进行排序

public class SortedUtil {


	private static int chineseNumber2Int(StudentInfo stu) {

		String chineseNumber = stu.getEname();

		int result = 0;
		int temp = 1;// 存放一个单位的数字如:十万
		int count = 0;// 判断是否有chArr
		char[] cnArr = new char[] { '一', '二', '三', '四', '五', '六', '七', '八', '九' };
		char[] chArr = new char[] { '十', '百', '千', '万', '亿' };
		for (int i = 0; i < chineseNumber.length(); i++) {
			boolean b = true;// 判断是否是chArr
			char c = chineseNumber.charAt(i);
			for (int j = 0; j < cnArr.length; j++) {// 非单位,即数字
				if (c == cnArr[j]) {
					if (0 != count) {// 添加下一个单位之前,先把上一个单位值添加到结果中
						result += temp;
						temp = 1;
						count = 0;
					}
					// 下标+1,就是对应的值
					temp = j + 1;
					b = false;
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
要实现中文数字排序,可以使用Java的Comparator接口来自定义排序规则。以下是一个实现中文数字排序的示例代码: ```java import java.util.Comparator; import java.util.regex.Matcher; import java.util.regex.Pattern; public class ChineseNumberComparator implements Comparator<String> { private static final String CHINESE_NUMBER_PATTERN = "[零一二三四五六七八九十百千万亿]+"; private static final String[] CHINESE_NUMBER_UNIT = new String[]{"亿", "万", "千", "百", "十"}; private static final int[] CHINESE_NUMBER_UNIT_VALUE = new int[]{100000000, 10000, 1000, 100, 10}; private static final String[] CHINESE_NUMBER_CHAR = new String[]{"零", "一", "二", "三", "四", "五", "六", "七", "八", "九"}; private static int getChineseNumberValue(String s) { int value = 0; int lastUnit = 0; for (int i = 0; i < s.length(); i++) { char c = s.charAt(i); if (c == '零') { continue; } int digit = getChineseNumberCharValue(c); if (digit == 10) { if (lastUnit == 0) { value += 10; } else { value += lastUnit * 10; lastUnit = 0; } } else if (digit > 0) { if (lastUnit == 0) { value += digit; } else { value += lastUnit * digit; lastUnit = 0; } } else { int unit = getChineseNumberUnitValue(c); if (unit > lastUnit) { lastUnit = unit; } else { value += lastUnit; lastUnit = unit; } } } if (lastUnit != 0) { value += lastUnit; } return value; } private static int getChineseNumberCharValue(char c) { for (int i = 0; i < CHINESE_NUMBER_CHAR.length; i++) { if (c == CHINESE_NUMBER_CHAR[i].charAt(0)) { return i; } } return -1; } private static int getChineseNumberUnitValue(char c) { for (int i = 0; i < CHINESE_NUMBER_UNIT.length; i++) { if (c == CHINESE_NUMBER_UNIT[i].charAt(0)) { return CHINESE_NUMBER_UNIT_VALUE[i]; } } return 0; } @Override public int compare(String s1, String s2) { Matcher matcher1 = Pattern.compile(CHINESE_NUMBER_PATTERN).matcher(s1); Matcher matcher2 = Pattern.compile(CHINESE_NUMBER_PATTERN).matcher(s2); int result = 0; while (matcher1.find() && matcher2.find() && result == 0) { String str1 = matcher1.group(); String str2 = matcher2.group(); int value1 = getChineseNumberValue(str1); int value2 = getChineseNumberValue(str2); result = Integer.compare(value1, value2); } if (result == 0) { result = s1.compareTo(s2); } return result; } } ``` 这个类

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值