void creatlist(linklist &l, int n){
l = new node();
l -> next = NULL;
while (int i = 1; i <= n; i++){
p = new node();
cin >> p -> data;
p -> next = l -> next;
l -> next = p;
}
}
逆序建立单链表
最新推荐文章于 2023-03-14 20:35:47 发布
void creatlist(linklist &l, int n){
l = new node();
l -> next = NULL;
while (int i = 1; i <= n; i++){
p = new node();
cin >> p -> data;
p -> next = l -> next;
l -> next = p;
}
}