js校验身份证号方法

先new一个对象.

已于 2022-10-24 13:50:16 修改

阅读量893

点赞数 1

文章标签： javascript 开发语言 ecmascript 1024程序员节

于 2022-09-30 15:21:02 首次发布

本文链接：https://blog.csdn.net/Gyh9421/article/details/127124239

版权

validIdNumber 为一个函数，直接调用传入身份证号即可，返回值 true 和 false 。

validIdNumber(code) {
      const city = {
        11: "北京",
        12: "天津",
        13: "河北",
        14: "山西",
        15: "内蒙古",
        21: "辽宁",
        22: "吉林",
        23: "黑龙江 ",
        31: "上海",
        32: "江苏",
        33: "浙江",
        34: "安徽",
        35: "福建",
        36: "江西",
        37: "山东",
        41: "河南",
        42: "湖北 ",
        43: "湖南",
        44: "广东",
        45: "广西",
        46: "海南",
        50: "重庆",
        51: "四川",
        52: "贵州",
        53: "云南",
        54: "西藏 ",
        61: "陕西",
        62: "甘肃",
        63: "青海",
        64: "宁夏",
        65: "新疆",
        71: "台湾",
        81: "香港",
        82: "澳门",
        91: "国外 ",
      };
      let pass = true;
      if (
        !code ||
        !/^\d{6}(18|19|20)?\d{2}(0[1-9]|1[012])(0[1-9]|[12]\d|3[01])\d{3}(\d|X|x)$/i.test(
          code
        )
      ) {
        pass = false;
      } else if (!city[code.substr(0, 2)]) {
        pass = false;
      } else {
        //18位身份证需要验证最后一位校验位
        code = code.toUpperCase();
        if (code.length === 18) {
          code = code.split("");
          //∑(ai×Wi)(mod 11)
          //加权因子
          let factor = [7, 9, 10, 5, 8, 4, 2, 1, 6, 3, 7, 9, 10, 5, 8, 4, 2];
          //校验位
          let parity = [1, 0, "X", 9, 8, 7, 6, 5, 4, 3, 2];
          let sum = 0;
          let ai = 0;
          let wi = 0;
          for (let i = 0; i < 17; i++) {
            ai = code[i];
            wi = factor[i];
            sum += ai * wi;
          }
          let last = parity[sum % 11];
          if (last + "" !== code[17] + "") {
            pass = false;
          }
        }
      }
      console.log(pass);
      // if (pass == true) {
      //   alert("身份证号验证通过");
      // } else {
      //   alert("身份证号验证不通过");
      // }
      return pass;
    },