U2579.链表

#include<iostream>
using namespace std;
struct node{
int data; //值
node *next; //结构体指针
};
int main(){
node *head,*r; //头结点
head = new node; //动态申请
//head->data=1;//*head.data;
head->next = NULL; //下一个数据 空
r = head; //一个数据都没

//添加一个结点
node *p;
p = new node;
p->data = 3;
p->next = NULL; 

//添加
r->next = p;
r = p; 

//删除
p->next = p->next->next; 
return 0;

}