链表的结点 :
typedef struct Node{ int data; struct Node* next; } Node;
已知链表的头结点head, 写一个函数把这个链表逆序:
Node* reverse(Node *head);
public void ReverseLink(Node head){ Node a; Node b; a= head.getNext(); if(a==null){ System.out.println("链表为空"); return; } while(a.getNext()!=null){//链表翻转 b = a.getNext(); a.setNext(b.getNext()); b.setNext(head.getNext()); head.setNext(b); } head = head.getNext(); while(head.getNext()!=null){//循环输出 System.out.print(head.getValue()+" "); head = head.getNext(); } System.out.println(head.getValue()); }
if( pHead == NULL)//如果聊表为空,直接返回NULL