leetcode-day8:Reverse Linked List(反转链表)

206. Reverse Linked List

链表：听说过两天反转链表又写不出来了？

Given the head of a singly linked list, reverse the list, and return the reversed list.
Example 1:

Input: head = [1,2,3,4,5]
Output: [5,4,3,2,1]

Example 2:

Input: head = [1,2]
Output: [2,1]

Example 3:

Input: head = []
Output: []

Constraints:

The number of nodes in the list is the range [0, 5000].
-5000 <= Node.val <= 5000

JAVA代码实现：

/**
再定义一个新的链表，实现链表元素的反转，这是对内存空间的浪费。
只需要改变链表的next指针的指向，直接将链表反转 ，而不用重新定义一个新的链表
*/
/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode() {}
 *     ListNode(int val) { this.val = val; }
 *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
 * }
 */
class Solution {
    public ListNode reverseList(ListNode head) {
		ListNode cur = head;
		ListNode pre = null;
		ListNode temp = null;
		//1->2->3->null
		//null 1->2->3->null
		while(cur!=null){
			temp=cur.next;
			cur.next=pre;
			pre=cur;
            cur=temp;
			
		}
        return pre;
    }
}