身份证号码检验

柔情只为你懂 2023-01-21 04:22 3阅读 0赞

# 身份证号码检验 #

> 作者：[Bright Xu][]

function verify(s) { 
        if (!(typeof (s) === 'string' || s instanceof String) || !/^\d{17}[0-9Xx]$/.test(s))
            return false
        const w = [7, 9, 10, 5, 8, 4, 2, 1, 6, 3, 7, 9, 10, 5, 8, 4, 2]
        const m = '10X98765432'
        let sums = 0
        for (let i = 0; i < s.length - 1; i++)
            sums += parseInt(s[i]) * w[i]
        return m[sums % 11].toUpperCase() === s[s.length - 1].toUpperCase()
    }

Python

def verify(s: str):
        import re
        if not isinstance(s, str) or not re.fullmatch(r'^\d{17}[0-9Xx]$', s):
            return False
        w = (7, 9, 10, 5, 8, 4, 2, 1, 6, 3, 7, 9, 10, 5, 8, 4, 2)
        m = '10X98765432'
        sums = 0
        for i in range(len(s)-1):
            sums += int(s[i]) * w[i]
        return m[sums % 11].upper() == s[-1].upper()

verify('350121191206231210')  // true

Java

public class Main { 
        static int[] w = { 7, 9, 10, 5, 8, 4, 2, 1, 6, 3, 7, 9, 10, 5, 8, 4, 2};
        static String[] m = { "1", "0", "X", "9", "8", "7", "6", "5", "4", "3", "2"};
    
        static boolean verify(String s) { 
            if (!s.matches("^\\d{17}[0-9Xx]$")) { 
                return false;
            }
            int sums = 0;
            for (int i = 0; i < s.length() - 1; i++) { 
                sums += (s.charAt(i) - '0') * w[i];
            }
            return m[sums % 11].equalsIgnoreCase(s.substring(s.length() - 1));
        }
    
        public static void main(String[] args) { 
            System.out.println(verify("350121191206231210"));  // true
            System.out.println(verify("35012119120623121X"));  // false
            System.out.println(verify("11010119120101126X"));  // true
            System.out.println(verify("11010119120101126x"));  // true
        }
    }

C++

#include<iostream>
    #include<regex>
    using namespace std;
    
    int w[] = {  7, 9, 10, 5, 8, 4, 2, 1, 6, 3, 7, 9, 10, 5, 8, 4, 2 };
    string m = "10X98765432";
    
    bool verify(string s) { 
    	if (!regex_match(s, regex("^\\d{17}[0-9Xx]$"))) { 
    		return false;
    	}
    	int sums = 0;
    	for (int i = 0; i < s.length() - 1; i++) { 
    		sums += (s[i] - '0') * w[i];
    	}
    	return m[sums % 11] == s[s.length() - 1] || (m[sums % 11] == 'X' && s[s.length() - 1] == 'x');
    }
    
    int main() { 
    	cout << verify("350121191206231210") << endl;  // 1
    	cout << verify("35012119120623121X") << endl;  // 0
    	cout << verify("11010119120101126X") << endl;  // 1
    	cout << verify("11010119120101126x") << endl;  // 1
    	return 0;
    }

[Bright Xu]: https://blog.csdn.net/weixin_44129085