单向指针链表的使用

//list.h

#pragma once

struct student
{
int i;
struct student *pnext;
};
typedef struct student STU;
class list
{
STU*phead;
int count;
public:
list();
STU*create();
void print();
void dele(int n);
void addhead(int i);
void find(int i);
~list();
};

//list.cpp

#include "list.h"
#include <iostream>
using namespace std;


list::list()
{
phead = 0;
count = 0;
}


STU*list::create()
{
STU*p1, *p2;
p1 = p2 = new student;
cin >> p1->i;
phead = p1;


p2->pnext = p1;
    p2 = p1;
p1 = new student;
    cin >> p1->i;
}


p2->pnext = NULL;


return (phead);
}
void list::print()
{


}
void list::dele(int n)
{
//STU*p = phead;
//while (!p)
//{
// if (p->i==n)


//}
}
void list::addhead(int i)
{

}
list::~list()
{
}

//main.cpp

#include<stdio.h>
#include<iostream>
using namespace std;
struct student
{
int i;
struct student *pnext;
};
typedef struct student STU;


int main()
{
puts("1.插入一个数");
puts("2.删除一个数");
puts("3.查找一个数");
cout << "请输入需要操作的数：" << endl;
int a;
cin >> a;
switch (a)
{
case 1:


break;
case 2:
break;
case 3:
break;




}






















return 1;
}