难度中等,看起来并不难,但实现起来还有点磕磕绊绊。
思考:
1.密码长度——length();
2.不重复字符——每个种类记个数;
3.不重复子串,其中字串长度大于2——双for,每三个一循环,一一对比
代码:
#include<iostream>
#include<string>
#include<unordered_set>
using namespace std;
int main()
{
string s;
while (cin >> s)
{
int len = s.length();
int count;
int count_1 = 0;
int count_2 = 0;
int count_3 = 0;
int count_4 = 0;
//判断1
if (len <= 8)
{
cout << "NG" << endl;
continue;
}
//判断2
for (int i = 0; i < len; i++)
{
if (s[i] >= 'a' && s[i] <= 'z')
{
count_1 = 1;
}
else if (s[i] >= 'A' && s[i] <= 'Z')
{
count_2 = 1;
}
else if (s[i] >= '0' && s[i] <= '9')
{
count_3 = 1;
}
else
count_4 = 1;
}
count = count_1 + count_2 + count_3 + count_4;
if (count < 3)
{
cout << "NG" << endl;
continue;
}
//判断三
int flag = 1;
for (int i = 0; i < len - 2; i++)
{
for (int j = i+1; j < len - 3; j++)
{
if (s.substr(i, 3) == s.substr(j, 3))
{
flag = 0;
break;
}
}
if (flag == 0)
{
break;
}
}
if (flag == 0)
{
cout << "NG" << endl;
continue;
}
else
cout << "OK" << endl;
}
return 0;
}
【有参考的成分,个人撕的时候遇到了一些小问题】
注意:
1. 判断字符种类的方法
2.判断重复子串,结束条件
3.截取字符串函数调用
总结:手撕代码前,理清逻辑 步骤,注意细节问题!