(LinkedListNode head)
| 31 | } |
| 32 | |
| 33 | public boolean isPalindrome(LinkedListNode head) { |
| 34 | int size = 0; |
| 35 | LinkedListNode n = head; |
| 36 | while (n != null) { |
| 37 | size++; |
| 38 | n = n.next; |
| 39 | } |
| 40 | Result p = isPalindromeRecurse(head, size); |
| 41 | return p.result; |
| 42 | } |
| 43 | |
| 44 | public static void main(String[] args) { |
| 45 | int length = 10; |
no test coverage detected