[CPP] LinkedList(2)

재학생인 후배녀석의 부탁으로 링크드리스트를 만들어주기로 했다.
뭐 이전에 대충 만들어놓은 틀이 있어서, 요구 조건만 조금씩 수정하여 만들어 주었다.
일반 LinkedList로 입력, 삭제, 검색, 모든정보삭제, 출력이 있다.
확실히 더블링크드리스트보다 소스가 지저분해진다는 느낌이 있었다. (이전노드를 항상 계산해주어야 해서 그렇다 ㅠ.ㅜ)

조건은 다음과 같다.

1. 정보출력 : 리스트에 있는 모든 정보를 학번순으로 출력
2. 학생입력 : 리스트에 저장시 학번순으로 저장
3. 학생삭제 : 학번을 입력받아 삭제, 존재하지 않으면 에러메시지 출력
4. 학생검색 : 검색기준, 검색조건 순으로 입력받아 검색을 수행, 검색기준이 studentNum이면 모든 field를 출력하고 검색기준이 다른 것이면 학번만 출력
5. 모든학생정보삭제 : list에 있는 모든 정보삭제

[작성환경 : Window XP   작성툴 : Visual Studio 6.0   컴파일러 : Visual Studio 6.0    사용언어 : C]
#include<iostream> using namespace std; class Node{ friend class List; public: Node(){ year=grade=0; next=NULL; name=NULL; }; Node(int y,float g,char *sN,char *n){ year=y; grade=g; strcpy(studentNum,sN); name=new char[sizeof(n)]; strcpy(name,n); next=NULL; } private: Node *next; int year; float grade; char studentNum[8]; char *name; }; class List{ private: Node *head; Node *tail; public: List(){ head=NULL; }; List(Node *insertNode){ head=NULL; insert(insertNode); }; void insert(Node *insertNode); void del(char* delStudentNum); void printList(); void allDelete(); void searchPrint(char* basis,char* condition); }; void List::searchPrint(char* basis,char* condition){ if(strcmp(basis,"studentNum")==0){ cout<<"=============================================="<<endl; cout<<"studentNum year name grade"<<endl; cout<<"=============================================="<<endl; for(Node *current=head;current!=NULL;current=current->next){ if(strcmp(current->studentNum,condition)==0){ cout<<current->studentNum<<" "<<current->year<<" "<<current->name<<" "<<current->grade<<endl; } }cout<<endl; } else if(strcmp(basis,"year")==0){ int yearValue=atoi(condition); cout<<"=============================================="<<endl; cout<<"studentNum"<<endl; cout<<"=============================================="<<endl; for(Node *current=head;current!=NULL;current=current->next){ if(current->year==yearValue){ cout<<current->studentNum<<endl; } }cout<<endl; } else if(strcmp(basis,"name")==0){ cout<<"=============================================="<<endl; cout<<"studentNum"<<endl; cout<<"=============================================="<<endl; for(Node *current=head;current!=NULL;current=current->next){ if(strcmp(current->name,condition)==0){ cout<<current->studentNum<<endl; } }cout<<endl; } else if(strcmp(basis,"grade")==0){ float gradeValue=atof(condition); cout<<"=============================================="<<endl; cout<<"studentNum"<<endl; cout<<"=============================================="<<endl; for(Node *current=head;current!=NULL;current=current->next){ if(current->grade==gradeValue){ cout<<current->studentNum<<endl; } }cout<<endl; }else{ cout<<endl<<"[You Enter Wrong Basis, Plz ReTry!]"<<endl; } }; void List::allDelete(){ if(head==NULL) cout<<endl<<"[List is Empty!]"<<endl<<endl; else{ Node *current; while(head!=NULL){ current=head; head=head->next; delete current; } cout<<endl<<"[ALL Delete Succeed!]"<<endl<<endl; } } void List::insert(Node *insertNode){ if(head==NULL){ head=tail=insertNode; cout<<endl<<"[Insert Succeed!]"<<endl<<endl; } else{ if((strcmp(head->studentNum,insertNode->studentNum))>0){ insertNode->next=head; head=insertNode; cout<<endl<<"[Insert Succeed!]"<<endl<<endl; return; } Node *beforeCurrent; for(Node *current=head;current!=NULL;current=current->next){ if(strcmp(current->studentNum,insertNode->studentNum)>0){ insertNode->next=current; beforeCurrent->next=insertNode; cout<<endl<<"[Insert Succeed!]"<<endl<<endl; return; } if(strcmp(current->studentNum,insertNode->studentNum)==0){ cout<<endl<<"[Already StudentNum exist! retry Plz!]"<<endl<<endl; return; } beforeCurrent=current; } tail->next=insertNode; tail=insertNode; cout<<endl<<"[Insert Succeed!]"<<endl<<endl; } }; void List::del(char *delStudentNum){ if(head==NULL) cout<<endl<<"[List is Empty!]"<<endl<<endl; else{ Node *beforeCurrent=NULL; for(Node *current=head;current!=NULL;current=current->next){ if(strcmp(current->studentNum,delStudentNum)==0){ if(beforeCurrent==NULL) head=current->next; //check first Node else{ beforeCurrent->next=current->next; if(current->next==NULL) tail=beforeCurrent; } delete current; cout<<endl<<"[Delete Succeed!]"<<endl<<endl; return; } beforeCurrent=current; } cout<<endl<<"[Cannot Find that StudentNum! Retry Plz!]"<<endl<<endl; } }; void List::printList(){ if(head==NULL){ cout<<endl<<"[List is Empty!!]"<<endl<<endl; } else{ cout<<"=============================================="<<endl; cout<<"studentNum year name grade"<<endl; cout<<"=============================================="<<endl; for(Node *ptr=head;ptr!=NULL;ptr=ptr->next){ cout<<ptr->studentNum<<" "<<ptr->year<<" "<<ptr->name<<" "<<ptr->grade<<endl; }cout<<endl; } }; void inputSet(List *linkedList){ int select; cout<<"1.Insert 2.Delete 3.PrintList 4.All Delete 5.Search 6.Exit"<<endl<<">>"; cin>>select; switch(select){ case 1:{ int year; float grade; char studentNum[8]; char name[20]; cout<<"Input StudentNum(a?????? - Use 6 Space) : "; cin>>studentNum; cout<<"Input Year : "; cin>>year; cout<<"Input Name : "; cin>>name; cout<<"Input Grade : "; cin>>grade; Node *inputNode=new Node(year,grade,studentNum,name); linkedList->insert(inputNode); break;} case 2:{ char studentNum[8]; cout<<"Enter Delete StudentNum : "; cin>>studentNum; linkedList->del(studentNum); break;} case 3: linkedList->printList(); break; case 4: linkedList->allDelete(); break; case 5:{ char basis[15]; char condition[10]; cout<<"Input Search Basis and Condition (FORM: [Basis] [Condition], ex: year 3) : "; scanf("%s %s",basis,condition); linkedList->searchPrint(basis,condition); break; } case 6: exit(0); break; default: break; } }; void main(){ List *linkedList=new List(); while(1) inputSet(linkedList); };

<실행해본 모습, 사실 걍 짧은 시간에 돌아가게만 만들었다. 즉 생각없이 돌아가게만 만들었음.. 허허>