import java.util.*;
/*
* public class ListNode {
* int val;
* ListNode next = null;
* }
*/
public class Solution {
/**
*
* @param head ListNode类 the head
* @return bool布尔型
*/
public boolean isPail (ListNode head) {
// write code here
List<Integer> list = new ArrayList<>();
while (head != null){
list.add(head.val);
head = head.next;
}
int left = 0, right = list.size() - 1;
while (left <= right){
if ((int)list.get(left) != (int)list.get(right)) return false;
left++;
right--;
}
return true;
}
}
先转换成数组,问题就变成了求数组是否是回文字符串了