java逆转链表

用java实现的逆转链表
206.Reverse a singly linked list.

public class Solution {    public ListNode reverseList(ListNode head) {        if(head == null)             return head;        ListNode p,temp;        p = head.next;        try{            head.next = null;            while(p != null ) {                temp = p.next;                p.next = head;                head = p;                p = temp;            }        }catch(NullPointerException e){        }        return head;    }}