牛客网在线编程专题《剑指offer-面试题16》反转链表

题目连接：

https://www.nowcoder.com/practice/75e878df47f24fdc9dc3e400ec6058ca?tpId=13&tqId=11168&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking

题目描述：

 解题思路：

定义三个指针：

1）pNode：指向当前遍历到的结点。

2）pPrev：指向当前遍历到的结点的前一个结点。

3）pNext：指向当前遍历到的结点的后一个结点。

public class reverseLinkedList {
	
	class ListNode{
		int val;
		ListNode next = null;
		
		public ListNode(int data) {
			this.val = data;
		}
	}
	
	public ListNode head;
	
	public void createLinkedList(int data) {
		if(head == null) {
			head = new ListNode(data);
		}else {
			ListNode node = new ListNode(data);
			node.next = head;
			head = node;
		}
	}
	
	public ListNode ReverseList(ListNode head) {
		ListNode pReversedHead = null;
		ListNode pNode = head;
		ListNode pPrev = null;
		while(pNode != null) {
			ListNode pNext = pNode.next;
			
			if(pNext == null) {
				pReversedHead = pNode;
			}
			
			pNode.next = pPrev;
			pPrev = pNode;
			pNode = pNext;
		}
		return pReversedHead;
	}

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		reverseLinkedList reverseList = new reverseLinkedList();
		for(int i=1; i<=5; i++) {
			reverseList.createLinkedList(i);
		}
		System.out.println(reverseList.ReverseList(reverseList.head).val);
	}

}