身份证号java正则表达式验证

<div class="iteye-blog-content-contain" style="font-size: 14px"></div>

 二话不说，直接上代码

/**
	 * 18位身份证校验,粗略的校验
	 * @author lyl
	 * @param idCard
	 * @return
	 */
	public static boolean is18ByteIdCard(String idCard){
		Pattern pattern1 = Pattern.compile("^(\\d{6})(19|20)(\\d{2})(1[0-2]|0[1-9])(0[1-9]|[1-2][0-9]|3[0-1])(\\d{3})(\\d|X|x)?$"); //粗略的校验
		Matcher matcher = pattern1.matcher(idCard);
		if(matcher.matches()){
			return true;
		}
		return false;
	}
	/**
	 * 18位身份证校验,比较严格校验
	 * @author lyl
	 * @param idCard
	 * @return
	 */
	public static boolean is18ByteIdCardComplex(String idCard){
		Pattern pattern1 = Pattern.compile("^(\\d{6})(19|20)(\\d{2})(1[0-2]|0[1-9])(0[1-9]|[1-2][0-9]|3[0-1])(\\d{3})(\\d|X|x)?$"); 
		Matcher matcher = pattern1.matcher(idCard);
		int[] prefix = new int[]{7,9,10,5,8,4,2,1,6,3,7,9,10,5,8,4,2};
		int[] suffix = new int[]{ 1, 0, 10, 9, 8, 7, 6, 5, 4, 3, 2 };
		if(matcher.matches()){
			Map<String, String> cityMap = initCityMap();
			if(cityMap.get(idCard.substring(0,2)) == null ){
				return false;
			}
			int idCardWiSum=0; //用来保存前17位各自乖以加权因子后的总和
			for(int i=0;i<17;i++){
				idCardWiSum+=Integer.valueOf(idCard.substring(i,i+1))*prefix[i];
			}
			
			int idCardMod=idCardWiSum%11;//计算出校验码所在数组的位置
			String idCardLast=idCard.substring(17);//得到最后一位身份证号码
			
			//如果等于2，则说明校验码是10，身份证号码最后一位应该是X
			if(idCardMod==2){
				if(idCardLast.equalsIgnoreCase("x")){
					return true;
				}else{
					return false;
				}
			}else{
			    //用计算出的验证码与最后一位身份证号码匹配，如果一致，说明通过，否则是无效的身份证号码
			    if(idCardLast.equals(suffix[idCardMod]+"")){
			    	return true;
			    }else{
			    	return false;
			    }
		   }
		}
		return false;
	}
	
	private static Map<String, String> initCityMap(){
		Map<String, String> cityMap = new HashMap<String, String>();
			cityMap.put("11", "北京");
			cityMap.put("12", "天津");
			cityMap.put("13", "河北");
			cityMap.put("14", "山西");
			cityMap.put("15", "内蒙古");
			
			cityMap.put("21", "辽宁");
			cityMap.put("22", "吉林");
			cityMap.put("23", "黑龙江");
			
			cityMap.put("31", "上海");
			cityMap.put("32", "江苏");
			cityMap.put("33", "浙江");
			cityMap.put("34", "安徽");
			cityMap.put("35", "福建");
			cityMap.put("36", "江西");
			cityMap.put("37", "山东");
			
			cityMap.put("41", "河南");
			cityMap.put("42", "湖北");
			cityMap.put("43", "湖南");
			cityMap.put("44", "广东");
			cityMap.put("45", "广西");
			cityMap.put("46", "海南");
			
			cityMap.put("50", "重庆");
			cityMap.put("51", "四川");
			cityMap.put("52", "贵州");
			cityMap.put("53", "云南");
			cityMap.put("54", "西藏");
			
			cityMap.put("61", "陕西");
			cityMap.put("62", "甘肃");
			cityMap.put("63", "青海");
			cityMap.put("64", "宁夏");
			cityMap.put("65", "新疆");
			
//			cityMap.put("71", "台湾");
//			cityMap.put("81", "香港");
//			cityMap.put("82", "澳门");
//			cityMap.put("91", "国外");
//			System.out.println(cityMap.keySet().size());
			return cityMap;
		}

 

评论

1 楼 perseusli 2017-12-30  

优化了一下:

public class IdcardNoValidateUtil {

    private final static Map<String, String> cityMap;
    //粗略的校验
    private static final Pattern pattern = Pattern.compile("^(\\d{6})(19|20)(\\d{2})(1[0-2]|0[1-9])(0[1-9]|[1-2][0-9]|3[0-1])(\\d{3})(\\d|X|x)?$");

    /**
     * 18位身份证校验,粗略的校验
     * @author lyl
     * @param idCard
     * @return
     */
    public static boolean is18ByteIdCard(CharSequence idCard){
        return pattern.matcher(idCard).matches();
    }
    /**
     * 18位身份证校验,比较严格校验
     * @author lyl
     * @param idCard
     * @return
     */
    public static boolean is18ByteIdCardComplex(CharSequence idCard){
        int[] prefix = new int[]{7,9,10,5,8,4,2,1,6,3,7,9,10,5,8,4,2};
        char[] suffix = new char[]{ '1', '0', 'X', '9', '8', '7', '6', '5', '4', '3', '2' };
        if(is18ByteIdCard(idCard)){
            if(cityMap.get(idCard.subSequence(0,2).toString()) == null ){
                return false;
            }
            int idCardWiSum=0;  //用来保存前17位各自乖以加权因子后的总和
            for(int i=0;i<17;i++){
                idCardWiSum+=(idCard.charAt(i) - '0') *prefix[i];
            }

            int idCardMod=idCardWiSum%11;//计算出校验码所在数组的位置
            char idCardLast=idCard.charAt(17);//得到最后一位身份证号码

            return idCardLast == suffix[idCardMod];
        }
        return false;
    }

    static {
        cityMap = new HashMap<>();
        cityMap.put("11", "北京");
        cityMap.put("12", "天津");
        cityMap.put("13", "河北");
        cityMap.put("14", "山西");
        cityMap.put("15", "内蒙古");

        cityMap.put("21", "辽宁");
        cityMap.put("22", "吉林");
        cityMap.put("23", "黑龙江");

        cityMap.put("31", "上海");
        cityMap.put("32", "江苏");
        cityMap.put("33", "浙江");
        cityMap.put("34", "安徽");
        cityMap.put("35", "福建");
        cityMap.put("36", "江西");
        cityMap.put("37", "山东");

        cityMap.put("41", "河南");
        cityMap.put("42", "湖北");
        cityMap.put("43", "湖南");
        cityMap.put("44", "广东");
        cityMap.put("45", "广西");
        cityMap.put("46", "海南");

        cityMap.put("50", "重庆");
        cityMap.put("51", "四川");
        cityMap.put("52", "贵州");
        cityMap.put("53", "云南");
        cityMap.put("54", "西藏");

        cityMap.put("61", "陕西");
        cityMap.put("62", "甘肃");
        cityMap.put("63", "青海");
        cityMap.put("64", "宁夏");
        cityMap.put("65", "新疆");

        cityMap.put("71", "台湾");
        cityMap.put("81", "香港");
        cityMap.put("82", "澳门");
        cityMap.put("91", "国外");
    }
}