234.palindrome linked list

 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class  {
    public boolean isPalindrome(ListNode head) {
        ListNode fast = head, slow = head;
        while(fast!=null&&fast.next!=null){
            fast = fast.next.next;
            slow = slow.next;
        }
        //slow -- mid
        ListNode tail = reverse(slow);
        //compare head->mid, tail->mid if they are the same
        while(tail!=null&&head!=null){
            if(tail.val!=head.val)
                return false;
            tail = tail.next;
            head = head.next;
        }
        return true;
    }
    public ListNode reverse(ListNode head){
        ListNode prev = null;
        while(head!=null){
            ListNode next = head.next;
            head.next = prev;
            prev = head;
            head = next;
        }
        //worth mentioning: return prev, when head comes to the end, 'prev=head' prev will get the last node, head will be null
        return prev;
    }
}