test2();
/**
* 方法测试
*/
function test2() {
echo '333030.22 => ' . inttocn(333030.22) . ''; // 三十三万三千零三十
echo '1111 => ' . inttocn(1111.0001) . ''; // 一千一百一十一
echo '101010101 => ' . inttocn(101010101) . ''; // 一亿一百零一万零一百零一
}
/**
* 数字转中文
* @param int $num 需要解析的数字
* @param string $string 初始值
* @return string
* @author anyon zou
* @date 2013-08-22 01:20
*/
function inttocn($num, $string = array()) {
if (!is_numeric($num)) {
return $num;
}
$splits = array('100000000' => '亿', '10000' => '万');
$chars = array('10000' => '万', '1000' => '千', '100' => '百', '10' => '十', '1' => '', '0' => '零');
$ints = array('零', '一', '二', '三', '四', '五', '六', '七', '八', '九', '十');
/*
* 拆分整数与小数
*/
$nums = explode('.', {$num});
$num = $nums[0];
// 处理小数
$dou = array();
if (!empty($nums[1])) {
foreach (str_split({$nums[1]}) as $n) {
if (is_numeric($n)) {
$dou[] = $ints[intval($n)];
}
}
}
unset($nums);
foreach ($splits as $step => $split) {
$floor = $step > 0 ? floor($num / intval($step)) : '0';
if ($floor > 0) {
$string[] = inttocn($floor) . $split;
$num = fmod($num, $step);
}
}
$string2 = array();
foreach ($chars as $step => $char) {
$floor = $step > 0 ? floor($num / intval($step)) : '0';
if ($floor > 0) {
$string[] = $string2[] = $ints[$floor] . $char;
$num = fmod($num, $step);
} else if ((count($string2) > 0 || (count($string) > 0 && $step != '10000')) && $string2[count($string) - 1] != $ints[0] && $num > 0) {
$string[] = $ints[0];
}
}
if (!empty($dou)) {
$string = array_merge($string, array('点'), $dou);
}
return join('', $string);
}测试结果
ad:真正免费,域名+虚机+企业邮箱=0元
