leetcode [#206] | GCidea's blog

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
public class Solution {
    public ListNode reverseList(ListNode head) {
        if(head == null || head.next == null) return head;
        ArrayList<Integer> valList = new ArrayList<Integer>();

        ListNode p = head;
        while (p != null){
            valList.add(p.val);
            p = p.next;
        }
        ListNode newHead = new ListNode(0);
        ListNode q = newHead;

        for(int k = valList.size()-1; k >= 0; k--){
            q.val = valList.get(k);
            if(k == 0){
                q.next = null;
            } else {
                q.next = new ListNode(0);
            }
            q = q.next;
        }
        return newHead;
    }
}