Day_24_More_Linked_Lists.cpp

#include <cstddef>
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
class Node
{
public:
	int data;
	Node *next;
	Node(int d) {
		data = d;
		next = NULL;
	}
};
class Solution {
public:

	Node* removeDuplicates(Node *head)
	{
		vector<int> v;
		Node* start = head;
		Node* prev = head;
		while (start != NULL) {
			if (find(v.begin(), v.end(), start->data) != v.end())
				prev->next = start->next;
			else {
				v.push_back(start->data);
				prev = start;
			}
			start = start->next;
		}
		return head;
	}

	Node* insert(Node *head, int data)
	{
		Node* p = new Node(data);
		if (head == NULL) {
			head = p;

		}
		else if (head->next == NULL) {
			head->next = p;

		}
		else {
			Node *start = head;
			while (start->next != NULL) {
				start = start->next;
			}
			start->next = p;

		}
		return head;


	}
	void display(Node *head)
	{
		Node *start = head;
		while (start)
		{
			cout << start->data << " ";
			start = start->next;
		}
	}
};

int main()
{
	Node* head = NULL;
	Solution mylist;
	int T, data;
	cin >> T;
	while (T-- > 0) {
		cin >> data;
		head = mylist.insert(head, data);
	}
	head = mylist.removeDuplicates(head);

	mylist.display(head);

}