数据结构学生成绩管理系统抽取不及格学生信息

Question

假如用一个链表保存学生语数英三门成绩，怎么用代码找出三门中有不及格的学生数据然后保存到另一个链表中啊

Answer 1

遍历链表所有节点啊

#include <iostream>
using namespace std;
typedef struct _node
{
    int data;
    struct _node *next;
}node;

int main()
{
    node * head = new node;
    node * newHead = new node;
    head->next = newHead->next = NULL;
    for(int i=0;i<3;i++)
    {
        node *p = new node;
        cin>>p->data;
        p->next = head->next;
        head->next = p;
    }
    node *q = head;
    node *p = head->next;
    while(p != NULL)
    {
        if(p->data < 60)
        {
            q->next = p->next;
            p->next = newHead->next;
            newHead->next = p;
            p = q->next;
        }
        else
        {
            q = p;
            p = p->next;
        }
    }
    p = newHead->next;
    while(p!=NULL)
    {
        cout<<p->data<<endl;
        p=p->next;
    }
    return 0;
}