Incorporate another function into this problem C++

[heavyc]

i have this problem and i am having trouble how to incorporate another function into this problem here is the problem..

#include <iostream>

using namespace std;

struct node {
int data;
node *next;
};

struct node *push_front ( node *list, int data )
{
node *p = new node;

p->data = data;
p->next = list;
list = p;

return list;
}

int main()
{
node *list = 0;
node *save;

for ( int i = 0; i < 10; i++ )
list = push_front ( list, rand() % 5 + 1 );

while ( list != 0 ) {
save = list->next;
cout<< list->data <<' ';
delete list;
list = save;



}

cout<<'\n';
}

and here is what i am trying to put in.., i have it written but i don't know what varibles to put and where to put it into the program..

for ( i = first; i != last; i = next ( i ) ) {
for ( j = next ( i ); j != last; j = next ( j ) ) {
if ( i == j )
unlink ( j );
}
}

 

[andrevdh]

Right up to the last part:

for ( i = first; i != last; i = next ( i ) ) {
for ( j = next ( i ); j != last; j = next ( j ) ) {
if ( i == j )
unlink ( j );
}
}

makes sense (except for a few minor problems), but nobody on Earth understands this last part. What are you trying to do with this part of the code? It seems you are travesing a new type of linked list (with the first and last nodes named) and at some node (j) you want to break the list into a new list or either cut the node (j) out of the original list.

 

[quicknote]

One possible way to incorporate another function into this problem is to create a function that checks for duplicates in the linked list and removes them. This function can be called after the for loop that adds random numbers to the list. Here is an example of how the code could look like:

// Function to check for duplicates in the linked list and remove them
void removeDuplicates(node *list) {
node *i, *j, *temp;

// Loop through the list
for (i = list; i != NULL; i = i->next) {
// Loop through the rest of the list
for (j = i->next; j != NULL; j = j->next) {
// Check if the data in the two nodes are the same
if (i->data == j->data) {
// Remove the duplicate node
temp = j;
j = j->next;
i->next = j;
delete temp;
}
}
}
}

// Main function
int main() {
node *list = 0;
node *save;

// Loop to add random numbers to the list
for (int i = 0; i < 10; i++) {
list = push_front(list, rand() % 5 + 1);
}

// Call the removeDuplicates function to remove any duplicates in the list
removeDuplicates(list);

// Loop to print the list
while (list != 0) {
save = list->next;
cout << list->data << ' ';
delete list;
list = save;
}

cout << '\n';
}