1
function checkProv(val) {
2
  var pattern = /^[1-9][0-9]/;
3
  var provs = {11:"北京",12:"天津",13:"河北",14:"山西",15:"内蒙古",21:"辽宁",22:"吉林",23:"黑龙江 ",31:"上海",32:"江苏",33:"浙江",34:"安徽",35:"福建",36:"江西",37:"山东",41:"河南",42:"湖北 ",43:"湖南",44:"广东",45:"广西",46:"海南",50:"重庆",51:"四川",52:"贵州",53:"云南",54:"西藏 ",61:"陕西",62:"甘肃",63:"青海",64:"宁夏",65:"新疆",71:"台湾",81:"香港",82:"澳门"};
4
  if(pattern.test(val)) {
5
    if(provs[val]) {
6
      return true;
7
    }
8
  }
9
  return false;
10

11
function checkDate(val) {
12
  var pattern = /^(18|19|20)\d{2}((0[1-9])|(1[0-2]))(([0-2][1-9])|10|20|30|31)$/;
13
  if(pattern.test(val)) {
14
    var year = val.substring(0, 4);
15
    var month = val.substring(4, 6);
16
    var date = val.substring(6, 8);
17
    var date2 = new Date(year+"-"+month+"-"+date);
18
    if(date2 && date2.getMonth() == (parseInt(month) - 1)) {
19
      return true;
20
    }
21
  }
22
  return false;
23
}
24
function checkCode(val) {
25
  var p = /^[1-9]\d{5}(18|19|20)\d{2}((0[1-9])|(1[0-2]))(([0-2][1-9])|10|20|30|31)\d{3}[0-9Xx]$/;
26
  var factor = [ 7, 9, 10, 5, 8, 4, 2, 1, 6, 3, 7, 9, 10, 5, 8, 4, 2 ];
27
  var parity = [ 1, 0, 'X', 9, 8, 7, 6, 5, 4, 3, 2 ];
28
  var code = val.substring(17);
29
  if(p.test(val)) {
30
    var sum = 0;
31
    for(var i=0;i<17;i++) {
32
      sum += val[i]*factor[i];
33
    }
34
    if(parity[sum % 11] == code.toUpperCase()) {
35
      return true;
36
    }
37
  }
38
  return false;
39
}
40

41

42
//检测密码是否是身份证
43
function checkID(val) {
44
  if (checkCode(val)) {
45
    var date = val.substring(6, 14);
46
    if (checkDate(date)) {
47
      if (checkProv(val.substring(0, 2))) {
48
        return true;
49
      }
50
    }
51
  }
52
  return false;
53
}
54

55
//密码不得包含键盘上任意连续的三个字符或shift转换字符
56
function validateKey(str) {
57
  //定义横向穷举
58
  var keyCode = [
59
    ["`~·", "1=", "2@@", "3#", "4$￥", "5%", "6^……", "7&", "8*", "9(（", "0）)", "-_", "=+"],
60
    [" ","qQ", "wW", "eE", "rR", "tT", "yY", "uU", "iI", "oO", "pP", "[{【", "]}】", "\\|、"],
61
    [" ","aA", "sS", "dD", "fF", "gG", "hH", "jJ", "kK", "lL", ";:", "\'\"’“"],
62
    [" ","zZ", "xX", "cC", "vV", "bB", "nN", "mM", ",《<", ".>》", "/?？"]
63
  ];
64

65
  //找出给出的字符串，每个字符，在坐标系中的位置。
66
  var c = str.split("");
67
  console.log(c)
68
  var x = new Array();
69
  var y = new Array();
70
  for (var i = 0; i < c.length; i++) {
71
    var temp = c[i];
72
    toHere:
73
        for (var j = 0; j < keyCode.length; j++) {
74
          for (var k = 0; k < keyCode[j].length; k++) {
75
            var jk = keyCode[j][k];
76
            if (jk.indexOf(temp)!=-1) {
77
              x.push(j);
78
              y.push(k);
79
              break toHere;
80
            }
81
          }
82
        }
83
  }
84
  var flag = false;
85
  for (var i = 0; i < x.length - 2; i++) {
86
    // 如果X一致，那么就是在一排
87
    if (x[i] == x[i + 1] && x[i + 1] == x[i + 2]) {//四者在同一行上
88
      if (y[i] > y[i + 2]) {
89
        if (y[i] - 1 == y[i + 1] && y[i] - 2 == y[i + 2]) {
90
          flag = true;
91
          break;
92
        }
93
      } else {
94
        if (y[i] + 1 == y[i + 1] && y[i] + 2 == y[i + 2]) {
95
          flag = true;
96
          break;
97
        }
98
      }
99
    } else if (x[i] != x[i + 1]
100
        && x[i + 1] != x[i + 2]
101
        && x[i] != x[i + 2]
102
    ) {//四者均不在同一行上,但是如果y相同，说明是一列
103
      if (y[i] == y[i + 1] && y[i + 1] == y[i + 2]) {
104
        flag = true;
105
        break;
106
      }
107
    }
108
  }
109
  return flag;
110
}
111

112

113
//不能相同字符（如111、aaa）连续3位或3位以上
114
function checkSame(str) {
115
  var re = /(\w)*(\w)\2{2}(\w)*/g;
116
  if(re.test(str)){
117
    return true;
118
  }else{
119
    return false;
120
  }
121
}
122

123
//不能连续字符（如123、abc）连续3位或3位以上
124
function checkRepeat(str){
125
  var arr = str.split('');
126
  var flag = false;
127
  for (var i = 1; i < arr.length-1; i++) {
128
    var firstIndex = arr[i-1].charCodeAt();
129
    var secondIndex = arr[i].charCodeAt();
130
    var thirdIndex = arr[i+1].charCodeAt();
131
    thirdIndex - secondIndex == 1;
132
    secondIndex - firstIndex==1;
133
    if((thirdIndex - secondIndex == 1)&&(secondIndex - firstIndex==1)){
134
      flag =  true;
135
    }
136
  }
137
  if(!flag){
138
    return flag;
139
  }
140
  return flag;
141
}

1
import org.apache.commons.lang3.StringUtils;
2
import java.util.ArrayList;
3
import java.util.List;
4
import java.util.regex.Matcher;
5
import java.util.regex.Pattern;
6

7
public class CheckPassword {
8

9
     /***
10
     * 描述: 三个或者三个以上相同
11
     *
12
     * @param pwd 密码
13
     * @return String
14
     */
15
    public static String check3(String pwd) {
16

17
        String regx = "^.*(.)\\1{2}.*$";
18
        Matcher m = null;
19
        Pattern p = null;
20
        p = Pattern.compile(regx);
21
        m = p.matcher(pwd);
22
        if (m.matches()) {
23
            return "包含三个或者三个以上相同";
24
        } else {
25
            return "ok";
26

27
        }
28

29
    }
30

31
    /***
32
     * 描述: 验证生日 、身份证
33
     *
34
     * @param pwd 密码
35
     * @return String
36
     */
37
    public static String checkBirthday(String pwd) {
38
        String birthday = "(([0-9]{3}[1-9]|[0-9]{2}[1-9][0-9]{1}|[0-9]{1}[1-9][0-9]{2}|[1-9][0-9]{3})(((0[13578]|1[02])(0[1-9]|[12][0-9]|3[01]))|((0[469]|11)(0[1-9]|[12][0-9]|30))|(02-(0[1-9]|[1][0-9]|2[0-8]))))|((([0-9]{2})(0[48]|[2468][048]|[13579][26])|((0[48]|[2468][048]|[3579][26])00))0229)";
39

40
        Pattern pattern = Pattern.compile(birthday);
41
        Matcher matcher = pattern.matcher(pwd);
42

43
        if (matcher.find()) {
44
            return "包含生日或者身份证";
45
        } else {
46
            return "ok";
47
        }
48

49
    }
50

51
    /***
52
     * 描述: 密码规则
53
     *
54
     * @param pwd 密码
55
     * @return String
56
     */
57
    public static String checkp(String pwd) {
58
        String str = "^(?![a-zA-Z]+$)(?![A-Z0-9]+$)(?![A-Z\\W_!@#$%^&*`~()-+=]+$)(?![a-z0-9]+$)(?![a-z\\W_!@#$%^&*`~()-+=]+$)(?![0-9\\W_!@#$%^&*`~()-+=]+$)[a-zA-Z0-9\\W_!@#$%^&*`~()-+=]{8,30}$";
59
        if (!pwd.matches(str)) {
60
            return "口令至少由8位及以上大小写字母、数字及特殊字符等混合、随机组成(至少包括数字、小写字母、大写字母和特殊符号中的三种)";
61
        } else {
62
            return "ok";
63
        }
64

65
    }
66

67
    /***
68
     * 描述: 验证密码
69
     *
70
     * @param pwd 密码
71
     * @return String
72
     */
73
    public static String checkPwd(String pwd) {
74
        //密码规则
75
        String check = checkp(pwd);
76
        //键盘上连续3位或者以上
77
        String rsThree = validateKey(pwd);
78

79
        String repeat = checkRepeat(pwd);
80
        //包含生日
81
        String checkBirthday = checkBirthday(pwd);
82
        //三个或者三个以上相同
83
        String check3 = check3(pwd);
84
        //包含手机号
85
        String checkMobile = checkMobile(pwd);
86
        //包含固定电话
87
        String checkPhone = checkPhone(pwd);
88

89

90
        if (!"ok".equals(check)) {
91
            return check;
92
        } else if (!"ok".equals(rsThree)) {
93
            return rsThree;
94
        } else if (!"ok".equals(repeat)) {
95
            return repeat;
96
        } else if (!"ok".equals(checkBirthday)) {
97
            return checkBirthday;
98
        } else if (!"ok".equals(check3)) {
99
            return check3;
100
        } else if (!"ok".equals(checkMobile)) {
101
            return checkMobile;
102
        } else if (!"ok".equals(checkPhone)) {
103
            return checkPhone;
104
        } else {
105
            return "true";
106
        }
107

108
    }
109

110
    /***
111
     * 描述: 密码是否包含手机号
112
     *
113
     * @param sParam 密码
114
     * @return String
115
     */
116
    public static String checkMobile(String sParam) {
117

118
        if (sParam.length() <= 0)
119
            return "";
120
        Pattern pattern = Pattern.compile("(1|861)(3|4|5|6||7|8|9)\\d{9}$*");
121
        Matcher matcher = pattern.matcher(sParam);
122
        StringBuffer bf = new StringBuffer();
123
        while (matcher.find()) {
124
            bf.append(matcher.group()).append(",");
125
        }
126
        int len = bf.length();
127
        if (len > 0) {
128
            bf.deleteCharAt(len - 1);
129
        }
130
        if (StringUtils.isNotBlank(bf.toString())) {
131
            return "包含手机号";
132
        } else {
133
            return "ok";
134
        }
135
    }
136

137
    /***
138
     * 描述: 包含固定电话
139
     *
140
     * @param content 电话
141
     * @return String
142
     */
143
    public static String checkPhone(String content) {
144
        List<String> list = new ArrayList<>();
145
        Pattern p = Pattern.compile("\\d{3}-\\d{8}|\\d{4}-\\d{6}|\\d{7}|\\d{8}");
146
        Matcher matcher = p.matcher(content);
147
        while (matcher.find()) {
148
            String n = matcher.group(0).toString();
149
            list.add(n);
150
        }
151
        if (!list.isEmpty()) {
152
            return "包含固定电话";
153
        } else {
154
            return "ok";
155
        }
156
    }
157

158
    /***
159
     * 描述: 密码不得包含键盘上任意连续的三个字符或shift转换字符
160
     *
161
     * @param str 字符串
162
     * @return String
163
     */
164
    public static String validateKey(String str) {
165

166
        //定义横向穷举
167
        String[][] keyCode = {
168
                {"`~·", "1=", "2@@", "3#", "4$￥", "5%", "6^……", "7&", "8*", "9(（", "0）)", "-_", "=+"},
169
                {" ", "qQ", "wW", "eE", "rR", "tT", "yY", "uU", "iI", "oO", "pP", "[{【", "]}】", "\\|、"},
170
                {" ", "aA", "sS", "dD", "fF", "gG", "hH", "jJ", "kK", "lL", ";:", "\'\"’“"},
171
                {" ", "zZ", "xX", "cC", "vV", "bB", "nN", "mM", ",《<", ".>》", "/?？"}
172
        };
173

174
        //找出给出的字符串，每个字符，在坐标系中的位置。
175
        char[] c = str.toCharArray();
176
        List<Integer> x = new ArrayList<Integer>();
177
        List<Integer> y = new ArrayList<Integer>();
178
        for (int i = 0; i < c.length; i++) {
179
            char temp = c[i];
180
            toHere:
181
            for (int j = 0; j < keyCode.length; j++) {
182
                for (int k = 0; k < keyCode[j].length; k++) {
183
                    String jk = keyCode[j][k];
184
                    if (jk.contains(String.valueOf(temp))) {
185
                        x.add(j);
186
                        y.add(k);
187
                        break toHere;
188
                    }
189
                }
190
            }
191
        }
192
        boolean flag = false;
193
        for (int i = 0; i < x.size() - 2; i++) {
194
            // 如果X一致，那么就是在一排
195
            if (x.get(i) == x.get(i + 1) && x.get(i + 1) == x.get(i + 2)) {//四者在同一行上
196
                if (y.get(i) > y.get(i + 2)) {
197
                    if (y.get(i) - 1 == y.get(i + 1) && y.get(i) - 2 == y.get(i + 2)) {
198
                        flag = true;
199
                        break;
200
                    }
201
                } else {
202
                    if (y.get(i) + 1 == y.get(i + 1) && y.get(i) + 2 == y.get(i + 2)) {
203
                        flag = true;
204
                        break;
205
                    }
206
                }
207

208
            } else if (x.get(i) != x.get(i + 1)
209
                    && x.get(i + 1) != x.get(i + 2)
210
                    && x.get(i) != x.get(i + 2)
211
            ) {//四者均不在同一行上,但是如果y相同，说明是一列
212
                if (y.get(i) == y.get(i + 1) && y.get(i + 1) == y.get(i + 2)) {
213
                    flag = true;
214
                    break;
215
                }
216
            }
217

218
        }
219
        if (flag) {
220
            return "不能连续三个或者三个以上字符";
221

222
        } else {
223
            return "ok";
224
        }
225
    }
226

227
    /**
228
     * 转码
229
     *
230
     * @param c 字符
231
     * @return 编码
232
     */
233
    public static int getUnicode(char c) {
234
        String returnUniCode = null;
235
        returnUniCode = String.valueOf((int) c);
236
        return Integer.parseInt(returnUniCode);
237
    }
238

239
    /***
240
     * 描述: 不能连续字符（如123、abc）连续3位或3位以上
241
     *
242
     * @param str 字符串
243
     * @return String
244
     */
245
    public static String checkRepeat(String str) {
246
        String[] arr = str.split("");
247
        boolean flag = false;
248
        for (int i = 1; i < arr.length - 1; i++) {
249
            int firstIndex = getUnicode(arr[i - 1].charAt(0));
250
            int secondIndex = getUnicode(arr[i].charAt(0));
251
            int thirdIndex = getUnicode(arr[i + 1].charAt(0));
252
            if ((thirdIndex - secondIndex == 1) && (secondIndex - firstIndex == 1)) {
253
                flag = true;
254
            }
255
        }
256
        if (flag) {
257
            return "不能连续3字母";
258

259
        } else {
260
            return "ok";
261
        }
262
    }
263

264
}