LeetCode 234 Palindrome Linked List

https://leetcode.com/problems/palindrome-linked-list

java

닫기 줄바꿈

/**
 * 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) {

​​​​​​​​ListNode node = head;
​​​​​​​​Stack<Integer> stack = new Stack<>();
​​​​​​​​ArrayList<Integer> list = new ArrayList<>();

​​​​​​​​while(node != null)
​​​​​​​​{
​​​​​​​​​​​​stack.push(node.val);
​​​​​​​​​​​​list.add(node.val);
​​​​​​​​​​​​node = node.next;

​​​​​​​​}

​​​​​​​​for(int i = 0; i < list.size(); i++)
​​​​​​​​{
​​​​​​​​​​​​if(stack.pop() != list.get(i))
​​​​​​​​​​​​​​​​return false;
​​​​​​​​}

​​​​​​​​return true;

​​​​}

}