//逆转
template
void SingleList::Reverse()
{
if (first == NULL) return;
Node *p, *latter;
Node *prev = NULL;
p = first->link;
while (p != NULL)
{
latter = p->link;
first->link = prev;
prev = first;
first = p;
p = latter;
}
}