题解 | #判断一个链表是否为回文结构#

import java.util.*;

/*
 * public class ListNode {
 *   int val;
 *   ListNode next = null;
 *   public ListNode(int val) {
 *     this.val = val;
 *   }
 * }
 */

public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param head ListNode类 the head
     * @return bool布尔型
     */
    public boolean isPail (ListNode head) {
        // write code here
        if (head == null){
            return false;
        }
        Stack<Integer> stackCopy = new Stack<>();
        List<Integer> copy = new ArrayList<>();
        while(head != null){
            stackCopy.push(head.val);
            copy.add(head.val);
            head = head.next;
        }
        for (Integer v : copy){
            if (!v.equals(stackCopy.pop())){
                return false;
            }
        }
        return true;
    }
}