Commit 5fcbc84c authored by 陈帅's avatar 陈帅

Replace your own algorithm with nzh

parent 29af079e
import moment from 'moment'; import moment from 'moment';
import React from 'react'; import React from 'react';
import nzh from 'nzh/cn';
import { parse, stringify } from 'qs'; import { parse, stringify } from 'qs';
export function fixedZero(val) { export function fixedZero(val) {
...@@ -69,39 +70,8 @@ export function getPlainNode(nodeList, parentPath = '') { ...@@ -69,39 +70,8 @@ export function getPlainNode(nodeList, parentPath = '') {
return arr; return arr;
} }
function accMul(arg1, arg2) {
let m = 0;
const s1 = arg1.toString();
const s2 = arg2.toString();
m += s1.split('.').length > 1 ? s1.split('.')[1].length : 0;
m += s2.split('.').length > 1 ? s2.split('.')[1].length : 0;
return (Number(s1.replace('.', '')) * Number(s2.replace('.', ''))) / 10 ** m;
}
export function digitUppercase(n) { export function digitUppercase(n) {
const fraction = ['', '']; return nzh.toMoney(n);
const digit = ['', '', '', '', '', '', '', '', '', ''];
const unit = [['', '', '亿'], ['', '', '', '', '']];
let num = Math.abs(n);
let s = '';
fraction.forEach((item, index) => {
s += (digit[Math.floor(accMul(num, 10 * 10 ** index)) % 10] + item).replace(/零./, '');
});
s = s || '';
num = Math.floor(num);
for (let i = 0; i < unit[0].length && num > 0; i += 1) {
let p = '';
for (let j = 0; j < unit[1].length && num > 0; j += 1) {
p = digit[num % 10] + unit[1][j] + p;
num = Math.floor(num / 10);
}
s = p.replace(/(零.)*零$/, '').replace(/^$/, '') + unit[0][i] + s;
}
return s
.replace(/(零.)*零元/, '')
.replace(/(零.)+/g, '')
.replace(/^整$/, '零元整');
} }
function getRelation(str1, str2) { function getRelation(str1, str2) {
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment