Framåtlista i C ++ | Set 2 (manipulering av funktioner)
Framåtlista i C ++ | Set 1 (introduktion och viktiga funktioner) Fler funktioner diskuteras i den här artikeln Vissa andra operationer än infogningar och borttagningar som kan användas i framåtlistor är följande:
1. slå ihop() :- Denna funktion används för att slå samman en framåtlista med andra. Om båda listorna sorteras sorteras också den resulterande listan som returneras.
2. operatör '=' :- Denna operatör kopierar en framåtlista till andra. Kopian som gjordes i detta fall är djup kopia.
CPP // C++ code to demonstrate the working of // merge() and operator= #include #include using namespace std ; int main () { // Initializing 1st forward list forward_list < int > flist1 = { 1 2 3 }; // Declaring 2nd forward list forward_list < int > flist2 ; // Creating deep copy using '=' flist2 = flist1 ; // Displaying flist2 cout < < 'The contents of 2nd forward list' ' after copy are : ' ; for ( int & x : flist2 ) cout < < x < < ' ' ; cout < < endl ; // Using merge() to merge both list in 1 flist1 . merge ( flist2 ); // Displaying merged forward list // Prints sorted list cout < < 'The contents of forward list ' 'after merge are : ' ; for ( int & x : flist1 ) cout < < x < < ' ' ; cout < < endl ; return 0 ; }
Produktion:
The contents of 2nd forward list after copy are : 1 2 3 The contents of forward list after merge are : 1 1 2 2 3 3
Tidskomplexitet: O (1)
Hjälputrymme: O (1)
3. sortera() :- Den här funktionen används för att sortera framåtlistan.
4. unik() :- Den här funktionen raderar flera händelser av ett nummer och returnerar en framåtlista med unika element. Framåtlistan ska sorteras för att denna funktion ska kunna köras framgångsrikt.
CPP // C++ code to demonstrate the working of // sort() and unique() #include #include // for sort() and unique() using namespace std ; int main () { // Initializing 1st forward list forward_list < int > flist1 = { 1 2 3 2 3 3 1 }; // Sorting the forward list using sort() flist1 . sort (); // Displaying sorted forward list cout < < 'The contents of forward list after ' 'sorting are : ' ; for ( int & x : flist1 ) cout < < x < < ' ' ; cout < < endl ; // Use of unique() to remove repeated occurrences flist1 . unique (); // Displaying forward list after using unique() cout < < 'The contents of forward list after ' 'unique operation are : ' ; for ( int & x : flist1 ) cout < < x < < ' ' ; cout < < endl ; return 0 ; }
Produktion:
The contents of forward list after sorting are : 1 1 2 2 3 3 3 The contents of forward list after unique operation are : 1 2 3
Tidskomplexitet: O (1)
Hjälputrymme: O (1)
5. motsatt() :- Den här funktionen används för att vända framåtlistan.
6. byta() :- Denna funktion byter innehållet i en framåtlista med andra.
CPP // C++ code to demonstrate the working of // reverse() and swap() #include #include // for reverse() and swap() using namespace std ; int main () { // Initializing 1st forward list forward_list < int > flist1 = { 1 2 3 }; // Initializing 2nd forward list forward_list < int > flist2 = { 4 5 6 }; // Using reverse() to reverse 1st forward list flist1 . reverse (); // Displaying reversed forward list cout < < 'The contents of forward list after' ' reversing are : ' ; for ( int & x : flist1 ) cout < < x < < ' ' ; cout < < endl < < endl ; // Displaying forward list before swapping cout < < 'The contents of 1st forward list ' 'before swapping are : ' ; for ( int & x : flist1 ) cout < < x < < ' ' ; cout < < endl ; cout < < 'The contents of 2nd forward list ' 'before swapping are : ' ; for ( int & x : flist2 ) cout < < x < < ' ' ; cout < < endl ; // Use of swap() to swap the list flist1 . swap ( flist2 ); // Displaying forward list after swapping cout < < 'The contents of 1st forward list ' 'after swapping are : ' ; for ( int & x : flist1 ) cout < < x < < ' ' ; cout < < endl ; cout < < 'The contents of 2nd forward list ' 'after swapping are : ' ; for ( int & x : flist2 ) cout < < x < < ' ' ; cout < < endl ; return 0 ; }
Produktion:
The contents of forward list after reversing are : 3 2 1 The contents of 1st forward list before swapping are : 3 2 1 The contents of 2nd forward list before swapping are : 4 5 6 The contents of 1st forward list after swapping are : 4 5 6 The contents of 2nd forward list after swapping are : 3 2 1
Tidskomplexitet: O (1)
Hjälputrymme: O (1)
7. rensa() :- Denna funktion rensar innehållet i framåtlistan. Efter denna funktion blir framåtlistan tom.
8. tömma() :- Den här funktionen returnerar sant om listan är tom annars falsk.
CPP // C++ code to demonstrate the working of // clear() and empty() #include #include // for clear() and empty() using namespace std ; int main () { // Initializing forward list forward_list < int > flist1 = { 1 2 3 }; // Displaying forward list before clearing cout < < 'The contents of forward list are : ' ; for ( int & x : flist1 ) cout < < x < < ' ' ; cout < < endl ; // Using clear() to clear the forward list flist1 . clear (); // Displaying list after clear() performed cout < < 'The contents of forward list after ' < < 'clearing are : ' ; for ( int & x : flist1 ) cout < < x < < ' ' ; cout < < endl ; // Checking if list is empty flist1 . empty () ? cout < < 'Forward list is empty' : cout < < 'Forward list is not empty' ; return 0 ; }
Produktion:
The contents of forward list are : 1 2 3 The contents of forward list after clearing are : Forward list is empty
Tidskomplexitet: O (1)
Hjälputrymme: O (1)
Nya artiklar på Forward_List
