zoukankan      html  css  js  c++  java
  • angularjs金额大写过滤器

    数字转中文

    MyAppFilter.filter('rmbFilter',[function(){
    
        function ChinaCost(input){
            var numberValue=new String(Math.round(input*100)); // 数字金额
            var chineseValue=""; // 转换后的汉字金额
            var String1 = "零壹贰叁肆伍陆柒捌玖"; // 汉字数字
            var String2 = "万仟佰拾亿仟佰拾万仟佰拾元角分"; // 对应单位
            var len=numberValue.length; // numberValue 的字符串长度
            var Ch1; // 数字的汉语读法
            var Ch2; // 数字位的汉字读法
            var nZero=0; // 用来计算连续的零值的个数
            var String3; // 指定位置的数值
            if(len>15){
            alert("超出计算范围");
            return "";
            }
            if (numberValue==0){
            chineseValue = "零元整";
            return chineseValue;
            }
    
            String2 = String2.substr(String2.length-len, len); // 取出对应位数的STRING2的值
            for(var i=0; i<len; i++){
            String3 = parseInt(numberValue.substr(i, 1),10); // 取出需转换的某一位的值
            if ( i != (len - 3) && i != (len - 7) && i != (len - 11) && i !=(len - 15) ){
            if ( String3 == 0 ){
            Ch1 = "";
            Ch2 = "";
            nZero = nZero + 1;
            }
            else if ( String3 != 0 && nZero != 0 ){
            Ch1 = "零" + String1.substr(String3, 1);
            Ch2 = String2.substr(i, 1);
            nZero = 0;
            }
            else{
            Ch1 = String1.substr(String3, 1);
            Ch2 = String2.substr(i, 1);
            nZero = 0;
            }
            }
            else{ // 该位是万亿,亿,万,元位等关键位
            if( String3 != 0 && nZero != 0 ){
            Ch1 = "零" + String1.substr(String3, 1);
            Ch2 = String2.substr(i, 1);
            nZero = 0;
            }
            else if ( String3 != 0 && nZero == 0 ){
            Ch1 = String1.substr(String3, 1);
            Ch2 = String2.substr(i, 1);
            nZero = 0;
            }
            else if( String3 == 0 && nZero >= 3 ){
            Ch1 = "";
            Ch2 = "";
            nZero = nZero + 1;
            }
            else{
            Ch1 = "";
            Ch2 = String2.substr(i, 1);
            nZero = nZero + 1;
            }
            if( i == (len - 11) || i == (len - 3)){ // 如果该位是亿位或元位,则必须写上
            Ch2 = String2.substr(i, 1);
            }
            }
            chineseValue = chineseValue + Ch1 + Ch2;
            }
    
            if ( String3 == 0 ){ // 最后一位(分)为0时,加上“整”
            chineseValue = chineseValue + "整";
            }
    
            return chineseValue;
        }
        return  function(input){
    		  if(input){
    		   return  ChinaCost(input);
    		  }
    	};
    
    }]);
    
    
  • 相关阅读:
    poj 1080 dp
    Codeforces Round #280 (Div. 2)
    Codeforces Round #279 (Div. 2)f
    Codeforces Round #278 (Div. 1)
    Codeforces Round #276 (Div. 1)
    搜索
    debug 心得
    ZOJ 1633
    DRF 一对多序列化与反序列化
    HTTP协议
  • 原文地址:https://www.cnblogs.com/ixiaohao/p/5241316.html
Copyright © 2011-2022 走看看