250x250
반응형
Notice
Recent Posts
Recent Comments
Link
목록reversed (1)
N
(Leet Code c++)Reverse Linked List
206. Reverse Linked List 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 next; } current = head; while(!stk.empty()){ ListNode * tmp = stk.top..
Leet Code 알고리즘
2021. 7. 23. 11:56