未验证 提交 7be0b8de 编写于 作者: M Marian Gusatu 提交者: GitHub

Update Linked List.cpp

fix: reverse check for empty list + cpplint coding style
上级 248c335b
...@@ -27,7 +27,7 @@ void insert(int x) { ...@@ -27,7 +27,7 @@ void insert(int x) {
void remove(int x) { void remove(int x) {
if (start == NULL) { if (start == NULL) {
cout << "\nLinked List is empty\n"; std::cout << "\nLinked List is empty\n";
return; return;
} else if (start->val == x) { } else if (start->val == x) {
node *temp = start; node *temp = start;
...@@ -44,7 +44,7 @@ void remove(int x) { ...@@ -44,7 +44,7 @@ void remove(int x) {
} }
if (temp == NULL) { if (temp == NULL) {
cout << endl << x << " not found in list\n"; std::cout << endl << x << " not found in list\n";
return; return;
} }
...@@ -57,21 +57,21 @@ void search(int x) { ...@@ -57,21 +57,21 @@ void search(int x) {
int found = 0; int found = 0;
while (t != NULL) { while (t != NULL) {
if (t->val == x) { if (t->val == x) {
cout << "\nFound"; std::cout << "\nFound";
found = 1; found = 1;
break; break;
} }
t = t->next; t = t->next;
} }
if (found == 0) { if (found == 0) {
cout << "\nNot Found"; std::cout << "\nNot Found";
} }
} }
void show() { void show() {
node *t = start; node *t = start;
while (t != NULL) { while (t != NULL) {
cout << t->val << "\t"; std::cout << t->val << "\t";
t = t->next; t = t->next;
} }
} }
...@@ -89,46 +89,46 @@ void reverse() { ...@@ -89,46 +89,46 @@ void reverse() {
start->next = NULL; start->next = NULL;
start = first; start = first;
} else { } else {
cout << "\nEmpty list"; std::cout << "\nEmpty list";
} }
} }
int main() { int main() {
int choice, x; int choice, x;
do { do {
cout << "\n1. Insert"; std::cout << "\n1. Insert";
cout << "\n2. Delete"; std::cout << "\n2. Delete";
cout << "\n3. Search"; std::cout << "\n3. Search";
cout << "\n4. Print"; std::cout << "\n4. Print";
cout << "\n5. Reverse"; std::cout << "\n5. Reverse";
cout << "\n0. Exit"; std::cout << "\n0. Exit";
cout << "\n\nEnter you choice : "; std::cout << "\n\nEnter you choice : ";
cin >> choice; std::cin >> choice;
switch (choice) { switch (choice) {
case 1: case 1:
cout << "\nEnter the element to be inserted : "; std::cout << "\nEnter the element to be inserted : ";
cin >> x; std::cin >> x;
insert(x); insert(x);
break; break;
case 2: case 2:
cout << "\nEnter the element to be removed : "; std::cout << "\nEnter the element to be removed : ";
cin >> x; std::cin >> x;
remove(x); remove(x);
break; break;
case 3: case 3:
cout << "\nEnter the element to be searched : "; std::cout << "\nEnter the element to be searched : ";
cin >> x; std::cin >> x;
search(x); search(x);
break; break;
case 4: case 4:
show(); show();
cout << "\n"; std::cout << "\n";
break; break;
case 5: case 5:
cout << "The reversed list: \n"; std::cout << "The reversed list: \n";
reverse(); reverse();
show(); show();
cout << "\n"; std::cout << "\n";
break; break;
} }
} while (choice != 0); } while (choice != 0);
......
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册