8주차 - solution. 김성주2

	public boolean isPalindrome(ListNode head) {
            Stack<Integer> stack = new Stack<>();

            ListNode tail = head;
            while (Objects.nonNull(tail)) {
                stack.push(tail.val);
                tail = tail.next;
            }

            while (!stack.empty()) {
                if (head.val == stack.pop()) {
                    head = head.next;
                } else {
                    return false;
                }
            }
            return true;
        }