@@ -0,0 +1,1026 @@
+package leetcode.palindrome_linked_list;%0A%0Aimport common.ListNode;%0A%0Apublic class Solution %7B%0A    public ListNode reverseList(ListNode head) %7B%0A        ListNode prev, cur;%0A        cur = head;%0A        prev = null;%0A        while(cur != null)%7B%0A            ListNode tmp = cur.next;%0A            cur.next = prev;%0A            prev = cur;%0A            cur = tmp;%0A        %7D%0A        return prev;%0A    %7D%0A    %0A    public boolean isPalindrome(ListNode head) %7B%0A        int n = 0;%0A        if(head == null %7C%7C head.next == null) return true;%0A        for(ListNode cur = head; cur != null; cur = cur.next)%7B%0A            n++;%0A        %7D%0A        ListNode list1 = head, list2 = head;%0A        for(int i = 0; i %3C n / 2; i++)%7B%0A            list2 = list2.next;%0A        %7D%0A        if(n %25 2 != 0) list2 = list2.next;%0A        list2 = reverseList(list2);%0A        for(int i = 0; i %3C n / 2; i++)%7B%0A            if(list1.val != list2.val)%0A                return false;%0A            list1 = list1.next;%0A            list2 = list2.next;%0A        %7D%0A        return true;%0A    %7D%0A%7D

Add java solution for 234. Palindrome Linked List