zoukankan      html  css  js  c++  java
  • Java: 把金额转换为汉字的类

    package cyachina.util;


    /**
     * Created by IntelliJ IDEA.
     * User: Administrator
     * Date: 2004-8-2
     * Time: 11:37:41
     * To change this template use File | Settings | File Templates.
     */
    public class MoneyUtil {

        public static String[] chineseDigits = new String[] { "零", "壹", "贰", "叁", "肆", "伍", "陆", "柒", "捌", "玖"};

        /**
         * 把金额转换为汉字表示的数量,小数点后四舍五入保留两位
         * @param amount
         * @return
         */
        public static String amountToChinese(double amount) {

            if(amount > 99999999999999.99 || amount < -99999999999999.99)
                throw new IllegalArgumentException("参数值超出允许范围 (-99999999999999.99 ~ 99999999999999.99)!");

            boolean negative = false;
            if(amount < 0) {
                negative = true;
                amount = amount * (-1);
            }

            long temp = Math.round(amount * 100);
            int numFen = (int)(temp % 10); // 分
            temp = temp / 10;
            int numJiao = (int)(temp % 10); //角
            temp = temp / 10;
            //temp 目前是金额的整数部分

            int[] parts = new int[20]; // 其中的元素是把原来金额整数部分分割为值在 0~9999 之间的数的各个部分
            int numParts = 0; // 记录把原来金额整数部分分割为了几个部分(每部分都在 0~9999 之间)
            for(int i=0; ; i++) {
                if(temp ==0)
                    break;
                int part = (int)(temp % 10000);
                parts[i] = part;
                numParts ++;
                temp = temp / 10000;
            }

            boolean beforeWanIsZero = true; // 标志“万”下面一级是不是 0

            String chineseStr = "";
            for(int i=0; i<numParts; i++) {

                String partChinese = partTranslate(parts[i]);
                if(i % 2 == 0) {
                    if("".equals(partChinese))
                        beforeWanIsZero = true;
                    else
                        beforeWanIsZero = false;
                }

                if(i != 0) {
                    if(i % 2 == 0)
                        chineseStr = "亿" + chineseStr;
                    else {
                        if("".equals(partChinese) && !beforeWanIsZero)   // 如果“万”对应的 part 为 0,而“万”下面一级不为 0,则不加“万”,而加“零”
                            chineseStr = "零" + chineseStr;
                        else {
                            if(parts[i-1] < 1000 && parts[i-1] > 0) // 如果"万"的部分不为 0, 而"万"前面的部分小于 1000 大于 0, 则万后面应该跟“零”
                                chineseStr = "零" + chineseStr;
                            chineseStr = "万" + chineseStr;
                        }
                    }
                }
                chineseStr = partChinese + chineseStr;
            }

            if("".equals(chineseStr))  // 整数部分为 0, 则表达为"零元"
                chineseStr = chineseDigits[0];
            else if(negative) // 整数部分不为 0, 并且原金额为负数
                chineseStr = "负" + chineseStr;

            chineseStr = chineseStr + "元";

            if(numFen == 0 && numJiao == 0) {
                chineseStr = chineseStr + "整";
            }
            else if(numFen == 0) { // 0 分,角数不为 0
                chineseStr = chineseStr + chineseDigits[numJiao] + "角";
            }
            else { // “分”数不为 0
                if(numJiao == 0)
                    chineseStr = chineseStr + "零" + chineseDigits[numFen] + "分";
                else
                    chineseStr = chineseStr + chineseDigits[numJiao] + "角" + chineseDigits[numFen] + "分";
            }

            return chineseStr;

        }


        /**
         * 把一个 0~9999 之间的整数转换为汉字的字符串,如果是 0 则返回 ""
         * @param amountPart
         * @return
         */
        private static String partTranslate(int amountPart) {

            if(amountPart < 0 || amountPart > 10000) {
                throw new IllegalArgumentException("参数必须是大于等于 0,小于 10000 的整数!");
            }


            String[] units = new String[] {"", "拾", "佰", "仟"};

            int temp = amountPart;

            String amountStr = new Integer(amountPart).toString();
            int amountStrLength = amountStr.length();
            boolean lastIsZero = true; //在从低位往高位循环时,记录上一位数字是不是 0
            String chineseStr = "";

            for(int i=0; i<amountStrLength; i++) {
                if(temp == 0)  // 高位已无数据
                    break;
                int digit = temp % 10;
                if(digit == 0) { // 取到的数字为 0
                    if(!lastIsZero)  //前一个数字不是 0,则在当前汉字串前加“零”字;
                        chineseStr = "零" + chineseStr;
                    lastIsZero = true;
                }
                else { // 取到的数字不是 0
                    chineseStr = chineseDigits[digit] + units[i] + chineseStr;
                    lastIsZero = false;
                }
                temp = temp / 10;
            }
            return chineseStr;
        }

        public static void main(String[] args) {

            if(args.length == 0) {
                System.out.println("转换演示:");
                System.out.println("-------------------------");
                System.out.println("25000000000005.999: " + amountToChinese(25000000000005.999));
                System.out.println("45689263.626: " + amountToChinese(45689263.626));
                System.out.println("0.69457: " + amountToChinese(0.69457));
                System.out.println("253.0: " + amountToChinese(253.0));
                System.out.println("0: " + amountToChinese(0));
                System.out.println("-------------------------");
                System.out.println("本程序用法:");
                System.out.println("    演示:        java MoneyUtil");
                System.out.println("    转换指定数字:java MoneyUtil [要转换的数字]");
                //System.out.println(Long.MAX_VALUE);
                //System.out.println(Long.MIN_VALUE);
            }
            else {
                System.out.println("转换结果:");
                System.out.println(args[0] + ": " + amountToChinese(Double.parseDouble(args[0])));
            }

        }

    }

  • 相关阅读:
    HDU2363 最短路+贪心
    stl-----map去重,排序,计数
    STL------sort三种比较算子定义
    栈------表达式求值
    踩水坑系列一
    第一周 动态规划Dynamic Programming(一)
    模拟递归回溯贪心专题入门
    HDU1013,1163 ,2035九余数定理 快速幂取模
    HDU1005 找规律 or 循环点 or 矩阵快速幂
    入门基础常识
  • 原文地址:https://www.cnblogs.com/bgming/p/251382.html
Copyright © 2011-2022 走看看