leetcode url

Solutions

ListNode *reverseList(ListNode *head) {
	if (head == nullptr) {
		return nullptr;
	}
	if (head->next == nullptr) {
		return head;
	}
	ListNode *prev = nullptr;
	ListNode *curr = head;
	ListNode *next = nullptr;
	while (curr) {
		next = curr->next;
		curr->next = prev;
		prev = curr;
		curr = next;
	}
	return prev;
}