单链表反向

reverse_list.c

typedef struct node{
  int val;
  struct node *next;
}node;

void reverse(node *currentNode)
{
  node *preNode = NULL;
  node *nextNode = NULL;

  while(currentNode) {
        //save the next node
        nextNode = currentNode->next;
        //update the value of "next"
        currentNode->next = preNode;
        //shift the pointers
        preNode = currentNode;

        currentNode = nextNode;
  }
}