单向链表做的，全RE

#include<iostream>
using namespace std;
struct Node{
	int data;
	Node* next;
};
int a,b,ans;
int main(){
	Node* head=new Node;
	head->data=0;
	cin>>a;
	Node* a1=new Node;
	a1->data=a;
	head->next=a1;
	cin>>b;
	Node* b1=new Node;
	b1->data=b;
	a1->next=b1;
	b1->next=NULL;
	Node* q=head->next;
	while(q!=NULL){
		ans+=q->data;
		q=q->next;
	}
	cout<<ans;
	delete b1;
	delete a1;
	delete head;
}