查看文章 |
5. 数据结构 顺序 链STL List_STL STL的一个引用 2005.01
2006-07-24 17:35
#include <list> #include <iostream> using namespace std; // 函数功能:正序显示 void Display(list <int> c) { list <int>::iterator Iter; cout << "list ="; for ( Iter = c.begin( ); Iter != c.end( ); Iter++ ) cout << " " << *Iter; cout << endl; } // 函数功能:倒序显示 void Rev_Display(list <int> c) { list <int>::reverse_iterator rvIter; cout << "list ="; for ( rvIter = c.rbegin( ); rvIter != c.rend( ); rvIter++ ) cout << " " << *rvIter; cout << endl; } int main( ) { list <int> c1, c2; list <int>::iterator Iter; c1.push_back( 10 ); // c1,c2各初始化3个值 c1.push_back( 20 ); c1.push_back( 30 ); c2.push_back( 40 ); c2.push_back( 50 ); c2.push_back( 60 ); // 正序c1 Display(c1); // 倒序c1 Rev_Display(c1); // c1插入100 Iter = c1.begin( ); Iter++; c1.insert( Iter, 100 ); Display(c1); // c1插入2个200 Iter = c1.begin( ); Iter++; Iter++; c1.insert( Iter, 2, 200 ); Display(c1); // c1中插入c2 c1.insert( ++c1.begin( ), c2.begin( ),--c2.end( ) ); Display(c1); return 0; } |
最近读者:

