연결리스트뒤집기
-
[LeetCode] 234. Palindrome Linked List / Swift프로그래밍/코딩테스트 2021. 6. 26. 02:08
[문제 보기] 더보기 Given the head of a singly linked list, return true if it is a palindrome. 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, 10^5]. 0
-
[LeetCode] 206. Reverse Linked List / Swift프로그래밍/코딩테스트 2021. 6. 25. 23:50
[문제 보기] 더보기 Given the head of a singly linked list, reverse the list, and return the reversed list. Example 1: Input: head = [1,2,3,4,5] Output: [5,4,3,2,1] Example 2: Input: head = [1,2] Output: [2,1] Example 3: Input: head = [] Output: [] Constraints: The number of nodes in the list is the range [0, 5000]. -5000 ListNode? { var stack = [ListNode]() var cur = head while cur != nil { stack.appen..