Algorithm문제풀이: LeetCode의 “234. Palindrome Linked List”
🧑🚀문제링크: https://leetcode.com/problems/palindrome-linked-list/
Given the head of a singly linked list, return true if it is a palindrome or false otherwise.
Example 1:
Input: head = [1,2,2,1]
Output: true
Example 2:
Input: head = [1,2]
Output: false
Constraints:
The number of nodes in the list is in the range [1, 105].
0 <= Node.val <= 9
Follow up: Could you do it in O(n) time and O(1) space?
💺여러분은 어떻게 접근하시고 또 해결 하셨는지 댓글로 알려주세요🚀
