链表中为什么少输出一个数？

Question

#include<stdio.h>
#include<stdlib.h>  
 typedef struct node
 {     int data; 
    struct node *next;
 }node,*list;  
list create(int n) 
 {  
    int i;  
    node *p,*q;node *head;  
    p=q= (node*) malloc (sizeof(node));      
    scanf("%d",&p->data); 
    for(i=0;i<n;i++) 
         {        
           if(i==0)    
             {     
                  head=p;     
                    }         
        else    
           {       
               q->next=p;    
            q=p;    
           p=(node*)malloc(sizeof(node));                  
           scanf("%d",&p->data);        
          }    
       }
           q->next=NULL;    
        return head; 
    }   
void print(node *head) 
        {  
            node *p;  
            p=head;  
            while(p!=NULL)    
          {      
             printf("%d ",p->data);          
            p=p->next;     
           }
           } 
            int main() 
             {  
                 int n;      
                scanf("%d",&n);  
                 node *head,*p;     
                head=create(n);      
                print(head); 
             }

Answer 1

#include <stdio.h>
#include <stdlib.h>

typedef struct node {
  int data;
  struct node *next;
} node, *list;

list create(int n) {
  int i;
  node *p, *q;
  node *head;
  p = q = (node *)malloc(sizeof(node));
  scanf("%d", &p->data);
  for (i = 0; i < n; i++) {
    if (i == 0) {
      head = p;
    } else {
      p = (node *)malloc(sizeof(node));
      q->next = p;
      q = p;
      scanf("%d", &p->data);
    }
  }
  q->next = NULL;
  return head;
}

void print(node *head) {
  node *p;
  p = head;
  while (p != NULL) {
    printf("%d ", p->data);
    p = p->next;
  }
}

int main() {
  int n;
  scanf("%d", &n);
  node *head, *p;
  head = create(n);
  print(head);
}