zoukankan      html  css  js  c++  java
  • JAVA把阿拉伯数字金额转换为中文汉字金额

    package util;
    
    /**
     * 输入的金额转换成中文大写,16位数字精确到小数点后2位数
     *
     */
    public class MoneyToCNFormat {
        private static final String[] CN_NUMBERS = { "零", "壹", "贰", "叁", "肆", "伍", "陆", "柒", "捌", "玖" };
        private static final String[] CN_MONETETARY_UNIT = { "分", "角", "元", "拾", "佰", "仟", "万", "拾", "佰", "仟", "亿", "拾",
                "佰", "仟", "兆", "拾", "佰", "仟" };
        private static final String CN_FULL = "整";
        private static final String CN_NEGATIVE = "负";
        private static final String CN_ZERO = "零角零分";
        private static final long MAX_NUMBER = 10000000000000000l;// 最大16位整数
        private static final String INVALID_AMOUNT = "金额超出最大金额千兆亿(16位整数)";
    
        public static String formatToCN(double amount) {
            if (Math.abs(amount) >= MAX_NUMBER)
                return INVALID_AMOUNT;
            StringBuilder result = new StringBuilder();
            long value = Math.abs(Math.round(amount * 100));
            int i = 0;
            while (true) {
                int temp = (int) (value % 10);
                result.insert(0, CN_MONETETARY_UNIT[i]);
                result.insert(0, CN_NUMBERS[temp]);
                value = value / 10;
                if (value < 1)
                    break;
                i++;
            }
            // "零角零分" 转换成 "整"
            int index = result.indexOf(CN_ZERO);
            if (index > -1) {
                result.replace(index, index + 4, CN_FULL);
            }
            // 负数
            if (amount < 0) {
                result.insert(0, CN_NEGATIVE);
            }
            return result.toString();
        }
    
        /**
         * 测试
         * 
         * @param args
         */
        public static void main(String[] args) {
            double amountTest = 987654321654321.12d;
            System.out.println("金额[" + amountTest + "]=" + formatToCN(amountTest));
    
            int amountTest2 = 98;
            System.out.println("金额[" + amountTest2 + "]=" + formatToCN(amountTest2));
        }
    
    }

  • 相关阅读:
    Coursera台大机器学习课程笔记8 -- Linear Regression
    近两年跟踪速度较快的算法小结(转)
    hdu 4278 Faulty Odometer
    hdu 2571 命运
    hdu 6168 Numbers
    Codeforces 888C:K-Dominant Character
    poj 3061 Subsequence
    poj 1852 Ants
    1115. Counting Nodes in a BST (30)
    1064. Complete Binary Search Tree (30)
  • 原文地址:https://www.cnblogs.com/xiejn/p/11979240.html
Copyright © 2011-2022 走看看