校验工具类

怼烎@ 2022-12-27 01:13 227阅读 0赞

import org.springframework.util.StringUtils;
    import java.util.ArrayList;
    import java.util.HashMap;
    import java.util.List;
    import java.util.Map;
    import java.util.regex.Matcher;
    import java.util.regex.Pattern;
    
    /**
     * @author ws
     * @description: 正则表达式工具
     * @datetime 2020/6/23 9:19
     */
    public class RegexUtil {
    
        //手机号码正则
        public static final String PHONE = "^(13[0-9]|14[579]|15[0-3,5-9]|16[6]|17[0135678]|18[0-9]|19[89])\\d{8}$";
    
        //整数正则表达式
        public static final String NUMBER_INT = "^\\d+$";
    
        //小数正则表达式
        public static final String NUMBER_FLOAT = "^(\\d+)|(\\d+\\.\\d+)$";
    
        //日期正则表达式
        public static final String DATE = "^\\d{4}[-]\\d{2}[-]\\d{2}$";
    
        //时间正则表达式
        public static final String TIME = "^\\d{2}[:]\\d{2}$";
    
        //身份证号正则表达式
        public static final String ID_CARD = "^[1-9]\\d{5}(19|20)\\d{2}((0[1-9])|(10|11|12))(([0-2][1-9])|10|20|30|31)\\d{3}[0-9Xx]$";
    
        /**
         * 验证字符串是否匹配正则
         *
         * @param str   待匹配的字符串
         * @param regex 待匹配的正则表达式
         * @return
         */
        public static boolean isMatcher(String str, String regex) {
            Pattern pattern = Pattern.compile(regex);
            Matcher matcher = pattern.matcher(str);
            return matcher.matches();
        }
    
        /**
         * 验证是否不匹配
         *
         * @param str
         * @param regex
         * @return
         */
        public static boolean isNotMatcher(String str, String regex) {
            return !isMatcher(str, regex);
        }
    
        /**
         * 提取字符串中符合正则的字符串集合
         *
         * @param str   待提取的字符串
         * @param regex 待匹配的正则表达式
         * @return
         */
        public static List<String> matcherList(String str, String regex) {
            List<String> list = new ArrayList<>();
            Pattern pattern = Pattern.compile(regex);
            Matcher matcher = pattern.matcher(str);
            while (matcher.find()) {
                list.add(matcher.group(1));
            }
            return list;
        }
    
        /**
         * 验证是否为手机号码
         */
        public static boolean isPhone(String str) {
            return isMatcher(str, PHONE);
        }
    
        /**
         * 验证是否为整数
         */
        public static boolean isInt(String str) {
            return isMatcher(str, NUMBER_INT);
        }
    
        /**
         * 验证是否为小数
         *
         * @param str
         * @return
         */
        public static boolean isFloat(String str) {
            return isMatcher(str, NUMBER_FLOAT);
        }
    
        /**
         * 验证是否为日期(yyyy-MM-dd)
         *
         * @param str
         * @return
         */
        public static boolean isDate(String str) {
            return isMatcher(str, DATE);
        }
    
        /**
         * 验证是否为时间(HH:mm)
         *
         * @param str
         * @return
         */
        public static boolean isTime(String str) {
            return isMatcher(str, TIME);
        }
    
        /**
         * 验证是否为银行卡
         *
         * @param str
         * @return
         */
        public static boolean isBankCardNo(String str) {
            String nonCheckCodeCardNo = str.substring(0, str.length() - 1);
            char[] chs = nonCheckCodeCardNo.trim().toCharArray();
            int sum = 0;
            for (int i = chs.length - 1, j = 0; i >= 0; i--, j++) {
                int k = chs[i] - '0';
                if (j % 2 == 0) {
                    k *= 2;
                    k = k / 10 + k % 10;
                }
                sum += k;
            }
            //用不含校验位的银行卡卡号，采用 Luhm 校验算法获得校验位(卡号最后一位为校验位)
            char checkChar = (sum % 10 == 0) ? '0' : (char) ((10 - sum % 10) + '0');
            //校验银行卡卡号(比较算出的校验位和卡号里的校验位)
            return checkChar == str.charAt(str.length() - 1);
        }
    
        /**
         * 验证是否为身份证号
         *
         * @param str
         * @return
         */
        public static boolean isIdCard(String str) {
            if (isNotMatcher(str, ID_CARD)) {
                return false;
            }
            //判断第18位校验值
            char[] charArray = str.toCharArray();
            //前十七位加权因子
            int[] idCardWi = {7, 9, 10, 5, 8, 4, 2, 1, 6, 3, 7, 9, 10, 5, 8, 4, 2};
            //这是除以11后，可能产生的11位余数对应的验证码
            String[] idCardY = {"1", "0", "X", "9", "8", "7", "6", "5", "4", "3", "2"};
            int sum = 0;
            for (int i = 0; i < idCardWi.length; i++) {
                int current = Integer.parseInt(String.valueOf(charArray[i]));
                int count = current * idCardWi[i];
                sum += count;
            }
            char idCardLast = charArray[17];
            int idCardMod = sum % 11;
            if (idCardY[idCardMod].toUpperCase().equals(String.valueOf(idCardLast).toUpperCase())) {
                return true;
            } else {
                return false;
            }
        }
    
        /**
         * 校验统一社会信用代码
         *
         * @param str
         * @return
         */
        public static boolean isBusinessCode(String str) {
            if (StringUtils.isEmpty(str) || str.length() != 18) {
                return false;
            }
            String baseCode = "0123456789ABCDEFGHJKLMNPQRTUWXY";
            char[] baseCodeArray = baseCode.toCharArray();
            Map<Character, Integer> codes = new HashMap<>();
            for (int i = 0; i < baseCode.length(); i++) {
                codes.put(baseCodeArray[i], i);
            }
            char[] businessCodeArray = str.toCharArray();
            char check = businessCodeArray[17];
            if (baseCode.indexOf(check) == -1) {
                return false;
            }
            int[] wi = {1, 3, 9, 27, 19, 26, 16, 17, 20, 29, 25, 13, 8, 24, 10, 30, 28};
            int sum = 0;
            for (int i = 0; i < 17; i++) {
                char key = businessCodeArray[i];
                if (baseCode.indexOf(key) == -1) {
                    return false;
                }
                sum += (codes.get(key) * wi[i]);
            }
            int value = 31 - sum % 31;
            return value == codes.get(check);
        }
    
        /**
         * 判断是否为密码
         */
        public static boolean isPassword(String password) {
            int len = password.length();
            if (len < 8 || len > 16) {
                return false;
            }
            String letter = "qwertyuiopasdfghjklzxcvbnmQWERTYUIOPASDFGHJKLZXCVBNM";
            String number = "1234567890";
            int x = 0;
            int y = 0;
            for (int i = 0; i < len; i++) {
                char c = password.charAt(i);
                if (letter.indexOf(c) > -1) {
                    x = 1;
                } else if (number.indexOf(c) > -1) {
                    y = 1;
                }
            }
            return x + y == 2;
        }
    
    }