校验码计算步骤
十七位数字本体码加权求和公式
S = Sum(Ai * Wi), i = 0, … , 16 ,先对前17位数字的权求和
Ai:表示第i位置上的身份证号码数字值(0~9)
Wi:7 9 10 5 8 4 2 1 6 3 7 9 10 5 8 4 2 (表示第i位置上的加权因子)
计算模Y = mod(S, 11)
根据模,查找得到对应的校验码
Y: 0 1 2 3 4 5 6 7 8 9 10
校验码: 1 0 X 9 8 7 6 5 4 3 2
对应的代码校验如下:
Java
public class IdentityCard{ int[] weight={7,9,10,5,8,4,2,1,6,3,7,9,10,5,8,4,2}; //十七位数字本体码权重 char[] valid={ '1','0','X','9','8','7','6','5','4','3','2'}; //mod11,对应校验码字符值 ///card是除去最后一位前17位的号码 public char getValidateCode(String card){ int sum=0; int mode=0; for(int i=0;i<card.length();i++){ sum=sum+Integer.parseInt(String.valueOf(card.charAt(i)))*weight[i]; } mode=sum%11; return valid[mode]; } } |
def get_id_card_verify_number(id_card): factor = [7, 9, 10, 5, 8, 4, 2, 1, 6, 3, 7, 9, 10, 5, 8, 4, 2] check_code_list = [1, 0, 'X', 9, 8, 7, 6, 5, 4, 3, 2] check_sum = sum([a * b for a, b in zip(factor, [int(a) for a in id_card[0:-1]])]) return check_code_list[check_sum % 11] |
|