急急，給一個循環(huán)的鏈表。不勝感激！

struct Node
{
int ID;
struct Node *prev, *next;
};

struct Node *create(int numbers)
{
struct Node *first, *last, *temp;
int i=1;

first = last = temp = new (struct Node);

temp->ID = i;
i++;
for (; i <= numbers; i++)
{
temp = new (struct Node);
temp->ID = i;
last->next = temp;
temp->prev = last;
last = temp;
}
last->next = first;
first->prev = last;
return first;
}

以上就是建立一個具有 numbers 個節(jié)點的雙向循環(huán)鏈表的主要代碼了