@@ -0,0 +1,813 @@
+/**%0A * Definition for ListNode.%0A * public class ListNode %7B%0A *     int val;%0A *     ListNode next;%0A *     ListNode(int val) %7B%0A *         this.val = val;%0A *         this.next = null;%0A *     %7D%0A * %7D%0A */ %0Apublic class Solution %7B%0A    /**%0A     * @param head: The head of linked list.%0A     * @return: The new head of reversed linked list.%0A     */%0A    public ListNode reverse(ListNode head) %7B%0A        // write your code here%0A        if (head == null) %7B%0A            return null;%0A        %7D%0A        ListNode dumpy = new ListNode(0);%0A        dumpy.next = head;%0A        ListNode p = head;%0A        ListNode tmp;%0A        %0A        while (p.next != null) %7B%0A            tmp = p.next;%0A            p.next = tmp.next;%0A            tmp.next = dumpy.next;%0A            dumpy.next = tmp;%0A        %7D%0A        %0A        return dumpy.next;%0A    %7D%0A%7D

Create ReverseLinkedList for LintCode