234. 回文链表
给你一个单链表的头节点 head ,请你判断该链表是否为回文链表。如果是,返回 true ;否则,返回 false 。
示例 1:
输入:head = [1,2,2,1]
输出:true
示例 2:
输入:head = [1,2]
输出:false
解法(双指针法)
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode() {}
* ListNode(int val) { this.val = val; }
* ListNode(int val, ListNode next) { this.val = val; this.next = next; }
* }
*/
class Solution {
public boolean isPalindrome(ListNode head) {
ArrayList<Integer> list = new ArrayList<Integer>();
//将链表的值复制到数组中
ListNode currentNode = head;
while(currentNode != null){
list.add(currentNode.val);
currentNode = currentNode.next;
}
//使用双指针判断是否回文
int front = 0;
int back = list.size()-1;
while(front < back){
if(!list.get(front).equals(list.get(back))){
return false;
}
front++;
back--;
}
return true;
}
}