Solution (leetcode-in-java 1.19 API)

java.lang.Object
- g0201_0300.s0234_palindrome_linked_list.Solution

```
public class Solution
extends Object
```
234 - Palindrome Linked List.
Easy

Given the head of a singly linked list, return true if it is a palindrome.

Example 1:

Input: head = [1,2,2,1]

Output: true

Example 2:

Input: head = [1,2]

Output: false

Constraints:
- The number of nodes in the list is in the range [1, 10⁵].
- 0 <= Node.val <= 9
Follow up: Could you do it in O(n) time and O(1) space?

- Constructor Summary
  
  Constructors
  Constructor Description
  
  Solution()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  boolean isPalindrome(ListNode head)
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
public Solution()
```

Method Detail

isPalindrome

public boolean isPalindrome(ListNode head)