Java正则验证

    /**
     * 验证手机号.
     * 
     * @param phone the phone
     * @return true, if successful
     */
    public static boolean isPhone(String phone){
        if(StringUtils.isBlank(phone)){
            return false;
        }
        String regex = "^[1][3,4,5,8][0-9]{9}$";
        Pattern p = Pattern.compile(regex);
        Matcher m = p.matcher(phone);
        return m.matches();
    }

 

 1     /**
     * 验证身份证号是否合法.
     *
     * @param idCard the id card
     * @return true, if is id card
     */
    public static boolean isIdCard(String idCard){
        String regex = "(((1[1-5])|(2[1-3])|(3[1-7])|(4[1-6])|(5[0-4])|(6[1-5])|71|(8[12])|91)\\d{4}(((19|20)\\d{2}(0[13-9]|1[012])(0[1-9]|[12]\\d|30))|((19|20)\\d{2}(0[13578]|1[02])31)|((19|20)\\d{2}02(0[1-9]|1\\d|2[0-8]))|((19|20)([13579][26]|[2468][048]|0[48])0229))(\\d{3})(\\d|X|x))";
        int[] factorArray = new int[]{7, 9, 10, 5, 8, 4, 2, 1, 6, 3, 7, 9, 10, 5, 8, 4, 2};
        String[] parityBit = new String[]{"1", "0", "X", "9", "8", "7", "6", "5", "4", "3", "2"};
        String[] idArray = new String[18];
        int intStrLen = idCard.length();
        String idStr = idCard;
        int sum = 0;
        
        if(StringUtils.isBlank(idCard)){
            return false;
        }
        
        //正则验证身份证格式是否正确
        Pattern pattern = Pattern.compile(regex);
        Matcher matcher = pattern.matcher(idCard);
        if(!matcher.matches()){
            return false;
        }
        
        //验证身份证号算法是否合法
        for(int i = 0; i < intStrLen; i ++){
            idArray[i] = idStr.charAt(i) + "";
            if(i < (intStrLen - 1)){
                sum += factorArray[i] * Integer.parseInt(idArray[i]);
            }
        }
        if(!parityBit[(sum % 11)].equalsIgnoreCase(idArray[intStrLen - 1])){
            return false;
        }
        return true;
    }