include iostream include ctime using namespace std struct ListNode int

#include <iostream>
#include <ctime>

using namespace std;

struct ListNode
{
	int value;
	ListNode* next = nullptr;
};

ListNode* getRandomList(int size);

void printList(ListNode* element);

int findKey(ListNode* element, int key);

void removeElement(ListNode* element, int index);

void swapWithNext(ListNode* element, int index);

void appendReversedList(ListNode* element);

int main() {
	ListNode* list = getRandomList(10);
	printList(list);

	int key;
	std::cout << "Key :";
	std::cin >> key;

	int index = findKey(list, key);
	removeElement(list, 0);
	swapWithNext(list, index);
	printList(list);

	appendReversedList(list);
	printList(list);

	system("pause");
	return 0;
}

ListNode* getRandomList(int size) {
	ListNode* list = new ListNode;

	ListNode* element = list;
	srand((unsigned)time(0));
	for (int i = 0; i < size; i++) {
		element->value = rand();
		element->next = new ListNode;
		element = element->next;
	}
	return list;
}

void printList(ListNode* element) {
	while (element->next != nullptr) {
		cout << element->value << " ";
		element = element->next;
	}
	cout << endl;
}

int findKey(ListNode* element, int key) {
	int index = 0;
	while (element->value != key && element->next != nullptr) {
		index++;
		element = element->next;
	}
	return index;
}

void removeElement(ListNode* element, int index) {
	for (int i = 0; i < index; i++) {
		element = element->next;
	}
	if (index = 0) {
		ListNode* temp = element;
		delete

	}

}

void swapWithNext(ListNode* element, int index) {
	for (int i = 0; i < index && element != nullptr; i++) {
		element = element->next;
	}
	if (element != nullptr && element->next != nullptr) {
		int temp_value = element->next->value;
		element->next->value = element->value;
		element->value = temp_value;
	}
}

void appendReversedList(ListNode* element) {
	ListNode* reversed_list = new ListNode;
	reversed_list->value = element->value;
	reversed_list->next = nullptr;
	/*while (element->next != nullptr) {
		ListNode* temp_element = new ListNode;
		temp_element->next = reversed_list;
		temp_element->value = element->next->value;
		reversed_list = temp_element;
		element = element->next;
	}*/
	element->next = reversed_list;
}