Java反转链表
/*
public class ListNode {
int val;
ListNode next = null;
ListNode(int val) {
this.val = val;
}
}*/
public class Solution {
public ListNode ReverseList(ListNode head) {
ListNode newHead=null;
while(head!=null){
ListNode temp=head.next;
head.next=newHead;
newHead=head;
head=temp;
}
return newHead;
}
}