题解 | #反转链表#
反转链表
http://www.nowcoder.com/practice/75e878df47f24fdc9dc3e400ec6058ca
/*
public class ListNode {
int val;
ListNode next = null;
ListNode(int val) {
this.val = val;
}
}*/
public class Solution {
public ListNode ReverseList(ListNode head) {
ListNode node=null;
ListNode nextnode;
while(head!=null){
nextnode=head.next;
head.next=node;
node=head;
head=nextnode;
}
return node;
}
}