实现QQ新帐户申请和老帐户登陆的简化版功能。最大挑战是:据说现在的QQ号码已经有10位数了。
输入格式:
输入首先给出一个正整数N(≤10
5
),随后给出N行指令。每行指令的格式为:“命令符(空格)QQ号码(空格)密码”。其中命令符为“N”(代表New)时表示要新申请一个QQ号,后面是新帐户的号码和密码;命令符为“L”(代表Login)时表示是老帐户登陆,后面是登陆信息。QQ号码为一个不超过10位、但大于1000(据说QQ老总的号码是1001)的整数。密码为不小于6位、不超过16位、且不包含空格的字符串。
输出格式:
针对每条指令,给出相应的信息:
1)若新申请帐户成功,则输出“New: OK”;
2)若新申请的号码已经存在,则输出“ERROR: Exist”;
3)若老帐户登陆成功,则输出“Login: OK”;
4)若老帐户QQ号码不存在,则输出“ERROR: Not Exist”;
5)若老帐户密码错误,则输出“ERROR: Wrong PW”。
输入样例:
5
L 1234567890 myQQ@qq.com
N 1234567890 myQQ@qq.com
N 1234567890 myQQ@qq.com
L 1234567890 myQQ@qq
L 1234567890 myQQ@qq.com
输出样例:
ERROR: Not Exist
New: OK
ERROR: Exist
ERROR: Wrong PW
Login: OK
(用二叉搜索树做的,但大数据时会频繁插入,有一个测试点运行超时了)
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define MaxSize 100
typedef struct Node * BinTree;
typedef char ElementType;
struct Node {
ElementType qq[MaxSize];
ElementType mima[MaxSize];
BinTree Left;
BinTree Right;
};
BinTree chaozhao (BinTree BT,char ch[]);
BinTree Insert (BinTree BT,char qq[],char mima[]);
int main(void) {
int n,i;
char qq[100],mima[1000],ch;
BinTree T,p;
T=p=NULL;
scanf ("%d\n",&n);
for (i=0;i<n;i++) {
scanf ("%c %s %s",&ch,qq,mima);
getchar ();
if (ch=='N') {
p=chaozhao(T,qq);
if (p!=NULL) printf ("ERROR: Exist\n");
else {
printf ("New: OK\n");
T = Insert (T,qq,mima);
}
}
else {
p=chaozhao(T,qq);
if (p==NULL) printf ("ERROR: Not Exist\n");
else {
if (strcmp(mima,p->mima)==0) printf("Login: OK\n");
else printf ("ERROR: Wrong PW\n");
}
}
}
return 0;
}
BinTree Insert (BinTree BT,char qq[],char mima[]) {
if (BT==NULL) {
BT=(BinTree)malloc(sizeof (struct Node));
strcpy(BT->qq,qq);
strcpy (BT->mima,mima);
BT->Left=BT->Right=NULL;
}
else {
if (strcmp(qq,BT->qq)>0) {
BT->Right=Insert (BT->Right,qq,mima);
}
else if (strcmp(qq,BT->qq)<0) BT->Left=Insert (BT->Left,qq,mima);
else return;
}
return BT;
}
BinTree chaozhao (BinTree BT,char qq[]) {
if (BT==NULL) return NULL;
else {
if (strcmp(qq,BT->qq)>0) return chaozhao(BT->Right,qq);
else if (strcmp(qq,BT->qq)<0) return chaozhao(BT->Left,qq);
else return BT;
}
}
(用散列表做的,感觉要注意好多细节才不会出错)
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
typedef struct Node * List;
typedef long long int ElementType;
struct Node{
ElementType qq;
char mima[20];
List Next;
};
//List Insert (List Head,long long int b,char y[]);
int main(void) {
long long int a,b,x;
int i,flag,n;
char y[20],ch;
List Head[100000]={NULL},p,Tmp;
scanf ("%d\n",&n);
for (i=0;i<n;i++) {
flag=0;
scanf ("%c %lld %s",&ch,&x,y);
getchar();
b = x%100000;
if (ch=='N') {
//a = x/1000;
if (Head[b]==NULL) {
printf ("New: OK\n");
Tmp=(List)malloc(sizeof (struct Node));
Tmp->qq=x;
strcpy(Tmp->mima,y);
Tmp->Next=NULL;
Head[b]=Tmp;
// Head[b] = Insert(Head[b],x,y);
}
else {
p=Head[b];
while (1) {
if (Head[b]->qq==x) {
flag=1;
break;
}
if (Head[b]->Next==NULL) break;
Head[b]=Head[b]->Next;
}
if (flag==1) printf ("ERROR: Exist\n");
else {
printf ("New: OK\n");
Tmp=(List)malloc(sizeof (struct Node));
Tmp->qq=x;
strcpy(Tmp->mima,y);
Tmp->Next=NULL;
Head[b]->Next=Tmp;
//Head[b] = Insert(Head[b],x,y);
}
Head[b]=p;
}
}
else {
if (Head[b]==NULL) printf ("ERROR: Not Exist\n");
else {
p=Head[b];
while (1) {
if (Head[b]->qq==x) {
flag=1;
break;
}
if (Head[b]->Next==NULL) break;
Head[b]=Head[b]->Next;
}
if (flag==0) printf ("ERROR: Not Exist\n");
else {
if (strcmp(Head[b]->mima,y)==0) printf ("Login: OK\n");
else printf ("ERROR: Wrong PW\n");
}
Head[b]=p;
}
}
}
return 0;
}
/*List Insert (List Head,long long int b,char y[]) {
List Pre,Tmp;
Pre=Tmp=NULL;
Tmp=(List)malloc(sizeof (struct Node));
Tmp->qq=b;
strcpy(Tmp->mima,y);
Tmp->Next=NULL;
if (Head==NULL) {
Head=Tmp;
}
else {
Head->Next=Tmp;
}
return Head;
}*/