DHU programming exercise

1 Find sequence elements （ Linked list ）

#include<iostream>
using namespace std;
/* to define a linklist node*/
struct node {
    
	int val;
	struct node *next;
};
/*create a list based on data input*/
node *createList() {
    
	node *head = NULL, *p, *tail = NULL;
	int n;
	cin >> n;
	for (int i = 0; i < n; i++)
	{
    
		int num;
		cin >> num;
		p = (node*)malloc(sizeof(node));//generate a new node
		if (head == NULL)
			head = p;
		else
			tail->next = p;

		p->val = num;
		p->next = NULL;
		tail = p;
	}
	return head;
}
/*traverse the linklist and find the target's location*/
int Locate(node *head, int num)
{
    
	node *p;
	p = head;
	int location = 1;
	while (p)
	{
    
		if (p->val == num)
			break;
		p = p->next;
		location++;
	}
	if (p == NULL)
		return 0;
	else
	    return location;
}
int main() {
    
	struct node *head;
	head = createList();
	int num;
	while (cin>>num)
	{
    
		int loc = Locate(head, num);
		if (loc != 0)
			cout << loc << endl;
		else
			cout << "no" << endl;
	}
	return 0;
}