if(head==nullptr){ cout<<"Empty List"<<endl;// 链表为空时输出 "Empty List" return; } constListNode*curr=head; while(curr->next!=nullptr){ cout<<curr->val<<"-"; curr=curr->next; } cout<<curr->val<<endl;// 输出最后一个元素的值,并换行 } intmain(){ ListNode*head=initList()...