public class ListNode { public int val; public ListNode next; public ListNode (int x) { val = x; } }*/ class Solution { public ListNode ReverseList(ListNode pHead) { if(pHead==null) return null; ListNode node=pHead; ListNode lastNode=null; ListNode nextNode=null; while(node.next!=null){ nextNode=nod...