Fremover i C ++ | Sett 2 (manipulering av funksjoner)
Fremover i C ++ | Sett 1 (introduksjon og viktige funksjoner) Flere funksjoner blir diskutert i denne artikkelen noen av operasjonene annet enn innsettinger og slettinger som kan brukes i fremoverlister er som følger:
1. fusjonere() :- Denne funksjonen brukes til å slå sammen en fremoverliste med andre. Hvis begge listene er sortert, blir den resulterende listen som returneres også sortert.
2. operatør '=' :- Denne operatøren kopierer en fremover liste til andre. Kopien som er laget i dette tilfellet er dyp kopi.
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 ; }
Produksjon:
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
Tidskompleksitet: O (1)
Hjelpeplass: O (1)
3. sortere() :- Denne funksjonen brukes til å sortere fremoverlisten.
4. unik() :- Denne funksjonen sletter flere forekomster av et tall og returnerer en fremoverliste med unike elementer. Fremoverlisten skal sorteres for at denne funksjonen skal utføre vellykket.
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 ; }
Produksjon:
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
Tidskompleksitet: O (1)
Hjelpeplass: O (1)
5. omvendt() :- Denne funksjonen brukes til å snu fremoverlisten.
6. Swap () :- Denne funksjonen bytter innholdet i en fremoverliste med andre.
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 ; }
Produksjon:
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
Tidskompleksitet: O (1)
Hjelpeplass: O (1)
7. klar() :- Denne funksjonen rydder innholdet i fremoverlisten. Etter denne funksjonen blir fremoverlisten tom.
8. tømme() :- Denne funksjonen returnerer sann hvis listen er tom ellers 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 ; }
Produksjon:
The contents of forward list are : 1 2 3 The contents of forward list after clearing are : Forward list is empty
Tidskompleksitet: O (1)
Hjelpeplass: O (1)
Nyere artikler på fremover_list
