【数据结构1】线性表的就地逆置

1.题目：

2.数组：

void array()
//设i,j分别指向a[0]和a[elenum-1]，每次循环将二者值交换，直到 i>mid 
{
	int mid = (elenum-1)/2;
	for(int i = 0,j = elenum-1; i <= mid; i++,j--)
	{
		int t = a[i];
		a[i] = a[j];
		a[j] = t;
	}
	for(int i = 0; i < elenum; i++)
	{
		cout << a[i] << " ";
	}
	cout << '\n'; 
	return;
}

3.链表：

void list(Node* head)
{
	//链表的就地逆置
    Node *p,*r;
	p = head->next;
	head->next = NULL;	
	//第一步
	
	while(p != NULL)
	{
	    r = p->next;
		p->next = head->next;
	    head->next = p;
	    p &