zoukankan      html  css  js  c++  java
  • php 1转成一

    function numToWord($num)

    {
    $chiNum = array('零', '一', '二', '三', '四', '五', '六', '七', '八', '九');
    $chiUni = array('','十', '百', '千', '万','十', '百', '千', '亿', '十', '百','千','万','十', '百', '千');
    $uniPro = array(4, 8);
    $chiStr = '';


    $num_str = (string)$num;

    $count = strlen($num_str);
    $last_flag = true; //上一个 是否为0
    $zero_flag = true; //是否第一个
    $temp_num = null; //临时数字
    $uni_index = 0;

    $chiStr = '';//拼接结果
    if ($count == 2) {//两位数
    $temp_num = $num_str[0];
    $chiStr = $temp_num == 1 ? $chiUni[1] : $chiNum[$temp_num].$chiUni[1];
    $temp_num = $num_str[1];
    $chiStr .= $temp_num == 0 ? '' : $chiNum[$temp_num];
    }else if($count > 2){
    $index = 0;
    for ($i=$count-1; $i >= 0 ; $i--) {
    $temp_num = $num_str[$i];
    if ($temp_num == 0) {
    $uni_index = $index%15;
    if ( in_array($uni_index, $uniPro)) {
    $chiStr = $chiUni[$uni_index]. $chiStr;
    $last_flag = true;
    }else if (!$zero_flag && !$last_flag ) {
    $chiStr = $chiNum[$temp_num]. $chiStr;
    $last_flag = true;
    }
    }else{
    $chiStr = $chiNum[$temp_num].$chiUni[$index%16] .$chiStr;

    $zero_flag = false;
    $last_flag = false;
    }
    $index ++;
    }
    }else{
    $chiStr = $chiNum[$num_str[0]];
    }
    return $chiStr;
    }

    $num = 101001545;
    echo numToWord($num);

  • 相关阅读:
    Machine learning 第8周编程作业 K-means and PCA
    Machine learning 第7周编程作业 SVM
    Machine learning第6周编程作业
    Machine learning 第5周编程作业
    小M的作物 最小割最大流
    k-近邻算法 python实现
    编辑距离 区间dp
    Machine learning第四周code 编程作业
    MDK5报错missing closing quote
    HDU 5512
  • 原文地址:https://www.cnblogs.com/chengfengchi/p/10260193.html
Copyright © 2011-2022 走看看