BV与AV号互转

最新推荐文章于 2024-04-02 09:54:04 发布

沈瀚

最新推荐文章于 2024-04-02 09:54:04 发布

阅读量2.1k

点赞数 1

分类专栏：前端文章标签： javascript

本文链接：https://blog.csdn.net/weixin_41727824/article/details/109161101

版权

前端专栏收录该内容

12 篇文章 1 订阅

订阅专栏

常量

//常量
   const a2bAddEnc = 8728348608;
   const a2bXorEnc = 0b1010100100111011001100100100;
   const a2bEncIndex = [11, 10, 3, 8, 4, 6];
   const a2bEncTable = "fZodR9XQDSUm21yCkr6zBqiveYah8bt4xsWpHnJE7jL5VG3guMTKNPAwcF";

bv号转av号

//bv号转av号
function bv2av(bv) {
      temp = 0;
      for (i = 0; i < a2bEncIndex.length; i++) {
        if (a2bEncTable.indexOf(bv[a2bEncIndex[i]]) == -1) {
          return "请输入正确的BV号！"
        } else {
          temp += a2bEncTable.indexOf(bv[a2bEncIndex[i]]) * Math.pow(a2bEncTable.length, i)
        }
      }
      temp = temp - a2bAddEnc ^ a2bXorEnc;
      return "av" + temp
    }

//av号转bv号
function av2bv(av) {
      av = av.splice("av")[0]
      temp = "BV1@@4@1@7@@";
      for (i = 0; i < a2bEncIndex.length; i++) {
        temp = temp.substring(0, a2bEncIndex[i]) + a2bEncTable[Math.floor(((av ^ a2bXorEnc) + a2bAddEnc) / Math.pow(a2bEncTable.length, i)) % a2bEncTable.length] + temp.substring(a2bEncIndex[i] + 1)
      }
      return temp
    }

合并后

    console.error("BV17x411w7KC");

    const a2bAddEnc = 8728348608;
    const a2bXorEnc = 0b1010100100111011001100100100;
    const a2bEncIndex = [11, 10, 3, 8, 4, 6];
   const a2bEncTable = "fZodR9XQDSUm21yCkr6zBqiveYah8bt4xsWpHnJE7jL5VG3guMTKNPAwcF";

    function bv2av(bv) {
      temp = 0;
      for (i = 0; i < a2bEncIndex.length; i++) {
        if (a2bEncTable.indexOf(bv[a2bEncIndex[i]]) == -1) {
          return "请输入正确的BV号！"
        } else {
          temp += a2bEncTable.indexOf(bv[a2bEncIndex[i]]) * Math.pow(a2bEncTable.length, i)
        }
      }
      temp = temp - a2bAddEnc ^ a2bXorEnc;
      return "av" + temp
    }

    function av2bv(av) {
      av = av.splice("av")[0]
      temp = "BV1@@4@1@7@@";
      for (i = 0; i < a2bEncIndex.length; i++) {
        temp = temp.substring(0, a2bEncIndex[i]) + a2bEncTable[Math.floor(((av ^ a2bXorEnc) + a2bAddEnc) / Math.pow(a2bEncTable.length, i)) % a2bEncTable.length] + temp.substring(a2bEncIndex[i] + 1)
      }
      return temp
    }