# include < iostream >
# include < fstream >
# include < string >
using namespace std ;
struct Node {
int value ;
Node * next ;
};
Node * createList ( string filename ) {
ifstream file ( filename ) ;
Node * head = nullptr ;
int value ;
while (file >> value ) {
Node * newNode = new Node { value , head };
head = newNode ;
}
file. close ();
return head ;
}
void printList ( Node * head ) {
while ( head != nullptr ) {
cout << head -> value << " " ;
head = head -> next ;
}
cout << endl ;
}
Node * getLastNode ( Node * head ) {
while ( head -> next != nullptr ) {
head = head -> next ;
}
return head ;
}
void reverseList ( Node *& head ) {
if ( head == nullptr || head -> next == nullptr ) {
return ;
}
Node * lastNode = getLastNode ( head );
while ( head != lastNode ) {
Node * temp = head ;
head = head -> next ;
temp -> next = lastNode -> next ;
lastNode -> next = temp ;
}
}
int main () {
Node * head = createList ( "file.txt" );
cout << "Original list : " ;
printList ( head );
reverseList ( head );
cout << " Reversed list : " ;
printList ( head );
// eliberam memoria alocata dinamic pentru noduri
while ( head != nullptr ) {
Node * temp = head ;
head = head -> next ;
delete temp ;
}
return 0 ;
}