public class ListNode { int val; ListNode next = null; ListNode(int val) { this.val = val; } }*/ public class Solution { public ListNode ReverseList(ListNode head) { ListNode p,r; p=head; if(head==null){ return null; } while(p.next!=null){ r=p.next; p.next=r.next; r.next=head; head=r; } return head;...
