JS浮点数的解决方案

解决办法：

1、 转为整数（大数）运算。

function add(a, b) { 
    const maxLen = Math.max(
    a.toString().split(".")[1].length, 
    b.toString().split(".")[1].length 
    );
    const base = 10 ** maxLen; 
    const bigA = BigInt(base * a);
    const bigB = BigInt(base * b);
    const bigRes = (bigA + bigB) / BigInt(base); 
    // 如果是 (1n + 2n) / 10n 是等于 0n的。。。 return Number(bigRes); 
}

export function mul(arg1, arg2) { // 乘法
  let m = 0
  let s1 = arg1.toString()
  let s2 = arg2.toString()
  try {
    m += s1.split('.')[1].length
  } catch (e) {}
  try {
    m += s2.split('.')[1].length
  } catch (e) {}
  return Number(s1.replace('.', '')) * Number(s2.replace('.', '')) / Math.pow(10, m)
}



export function add(arg1, arg2) { // 加法
  var r1 = 0,
    r2 = 0,
    m, s1 = arg1.toString(),
    s2 = arg2.toString();
  try {
    if (s1.split(".")[1] != undefined)
      r1 = s1.split(".")[1].length;
  } catch (e) {}
  try {
    if (s2.split(".")[1] != undefined)
      r2 = s2.split(".")[1].length;
  } catch (e) {}
  m = Math.pow(10, Math.max(r1, r2));
  return (mul(arg1, m) + mul(arg2, m)) / m;
}



export function div(arg1, arg2) { // 除法
  let t1 = 0
  let t2 = 0
  let r1
  let r2
  try {
    t1 = arg1.toString().split('.')[1].length
  } catch (e) {}
  try {
    t2 = arg2.toString().split('.')[1].length
  } catch (e) {}
  r1 = Number(arg1.toString().replace('.', ''))
  r2 = Number(arg2.toString().replace('.', ''))
  let intDiv = r1 / r2
  let pow = Math.pow(10, t2 - t1)
  return mul(intDiv, pow) // 这里用上面定义好的乘法运算
}




export function sub(arg1, arg2) { // 减法
  let r1, r2, m, n
  try {
    r1 = arg1.toString().split('.')[1].length
  } catch (e) {
    r1 = 0
  }
  try {
    r2 = arg2.toString().split('.')[1].length
  } catch (e) {
    r2 = 0
  }
  m = Math.pow(10, Math.max(r1, r2))
  n = (r1 >= r2) ? r1 : r2
  return ((arg1 * m - arg2 * m) / m).toFixed(n)
}