关注公众号程序猿从入门到入土查询更方便哦
试编写算法,在单向链表中删除所有的偶数元素节点
#include<bits/stdc++.h>
#define RESULT int
#define OK 1
#define ERROR 0
using namespace std;
typedef struct Node {
int data;
Node* next;
}LNode, * LinkList;
RESULT InitList(LinkList& L); //初始化链表
RESULT InsertData_Back(LinkList& L, int data); //尾插
RESULT InsertData_Sort(LinkList& L, int data); //排序
RESULT Output_LinkList(LinkList& L); //打印链表
int main() {
LinkList L = new LNode;
InitList(L);
int n = 0;
while (cin >> n) {
while (n!=0) {
InsertData_Back(L, n);
cin >> n;
}
LinkList p = L;
while (p->next->next!=NULL) {
if (p->next->data % 2 == 0) {
LinkList temp;
temp = p->next;
p->next = p->next->next;
delete temp;
}
else {
p = p->next;
}
}
if (p->next->next == NULL) {
if (p->next->data % 2 == 0) {
LinkList temp;
temp = p->next;
p->next = p->next->next;
delete temp;
}
}
Output_LinkList(L);
}
return 0;
}
RESULT InitList(LinkList& L) {
L = new LNode;
L->next = NULL;
return OK;
}
RESULT InsertData_Back(LinkList& L, int data) {
LinkList temp = new LNode;
temp->data = data;
temp->next = NULL;
LinkList p = L;
while (p->next != NULL) {
p = p->next;
}
p->next = temp;
return OK;
}
RESULT InsertData_Sort(LinkList& L, int data) {
LinkList p = L;
while (p->next != NULL && data > p->next->data) {
p = p->next;
}
if (p->next == NULL) {
InsertData_Back(L, data);
}
else {
LinkList temp = new LNode;
temp->data = data;
temp->next = p->next;
p->next = temp;
}
return 0;
}
RESULT Output_LinkList(LinkList& L) {
LinkList temp = L->next;
while (temp != NULL) {
cout << temp->data << " ";
temp = temp->next;
}
printf("\n");
return OK;
}