验证字符串是否是重复的数字字母(111,aaa)或连续的数字字母(123,ABC),基本思想是将字符串转为一个个的char进行计算,构造等差数列,根据a1,a2,计算出公差d,然后根据等差公式,依次判断后续位是否满足此等差数列通项公式,如果满足,则是等差数列!其中,111,aaa可以看做是公差为0的等差数列。下面是实现代码:
public static boolean checkPassword(String password, int lenght) {
StringBuilder stringBuilder = new StringBuilder(password);
if (password.length() == lenght) {
try {
int a1 = stringBuilder.charAt(0); //获取a1
int a2 = stringBuilder.charAt(1); //获取a2
int d = a2 - a1; //计算公差
for (int n = 1; n <= stringBuilder.length(); n++) {
int an = stringBuilder.charAt(n - 1);
if (a1 + d * (n - 1) != an) { //依次判断第n项是否满足该等差数列通项公式
System.out.println("满足要求");
return true;
}
}
if (d == 0) {
//公差为0,形为,111111,22222,aaaaaa,,,
} else {
//公差不为0,形为,123456,654321,abcdef,,,
}
} catch (Exception e) {
e.printStackTrace();
}
}
//不满足要求
return false;
}