reverse-linked-list.cpp

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

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */
class Solution
{
public:
	ListNode *reverseList(ListNode *head)
	{
		ListNode *previousElement = NULL;
		ListNode *currentElement = head;
		ListNode *nextElement = NULL;

		while (currentElement != NULL)
		{
			nextElement = currentElement->next;
			currentElement->next = previousElement;
			previousElement = currentElement;
			currentElement = nextElement;
		}
		return previousElement;
	}
};