提问：使用find在一个int型的list中寻找值为0的最后一个元素

[ysysbaobei]

题目要求：使用find在一个int型的list中寻找值为0的最后一个元素

请大家帮忙写出程序（p355/p369, page369_1.cpp）

[qq675927952]

up

[ysysbaobei]

[Quote=引用 1 楼 hqin6 的回复:]
一个while循环？为啥不用find_end呢？
[/Quote]
用 find_end()写了一个

#include <iostream>
#include <list>
#include <algorithm>
using namespace std;

int main()
{
	int x;
	list<int> ilist;
	while (cin >> x)
		ilist.push_back(x);
	list<int>::reverse_iterator rlter;
	int search(0);
	rlter = find(ilist.rbegin(), ilist.rend(), search); // p281/295
	cout << *rlter << endl;
	cout << *--rlter << endl; // 测试是否是最后一个0而用的；-- 指向 顺序方向的下一个元素

	list<int> ilist2(1);
	list<int>::iterator lter = find_end(ilist.begin(), ilist.end(), ilist2.begin(), ilist2.end()); // find_end()查找
	cout << *lter << endl;
	cout << *++lter << endl;

	return 0;
}

[ysysbaobei]

[Quote=引用 5 楼 ztz0223 的回复:]
给一个程序哈哈：

C/C++ code#include <list>
#include <algorithm>
#include <iostream>

int main() {
using namespace std;

list <int> L;
list <int>::iterator Iter;


L.push_back( 40 );
L.push_back( 20 );
L.push_back( 10 );
L.push_back( 30 );
L.push_back( 0 );

cout << "L = ( " ;
for ( Iter = L.begin( ) ; Iter != L.end( ) ; Iter++ )
co…
[/Quote]
改写了一下：

#include <list>
#include <algorithm>
#include <iostream>
using namespace std;

int main() 
{   
   list <int> L;
   list <int>::iterator Iter;
/*     
   L.push_back( 40 );
   L.push_back( 20 );
   L.push_back( 10 );
   L.push_back( 30 );
   L.push_back( 0 );
*/
   int x;
   while (cin >> x)
	   L.push_back(x);

   cout << "L = ( " ;
   for (Iter = L.begin() ; Iter != L.end() ; Iter++)
      cout << *Iter << " ";
   cout << ")" << endl;

   list <int>::reverse_iterator result;
   result = find(L.rbegin(), L.rend(), 0);
   if  (result == L.rend())
      cout << "There is no 0 in list L.";
   else 
   {
      cout << "There is a 0 in list L";

	  if (result != L.rbegin()) // 输出边上的一个值
	  {
		  cout << " , and it is surround by " << *--result;
	      ++result;
	  }
      if (++result != L.rend()) // 输出边上的另一个值
	  {
		  cout << " and " << *result << endl;
	  }
   }
   cout << endl;

   return 0;
}

[ysysbaobei]

问题解决，谢谢大家
感觉是看到书本后面，忘了前面
结贴了

[太乙]

一个while循环？为啥不用find_end呢？

[taodm]

rbegin(), rend()

[ysysbaobei]

翻看了一下书本前面讲的 list容器里，find（）的用法，写了一个程序

#include <iostream>
#include <list>
#include <algorithm>
using namespace std;

int main()
{
	int x;
	list<int> ilist;
	while (cin >> x)
		ilist.push_back(x);
	list<int>::reverse_iterator rlter;
	int search(0);
	rlter = find(ilist.rbegin(), ilist.rend(), search); // p281/295
	cout << *rlter << endl;
	cout << *--rlter << endl; // 测试是否是最后一个0而用的；-- 指向 顺序方向的下一个元素

	return 0;
}

[qq7400264]

不错不错

[就呆在云上]

给一个程序哈哈：

#include <list>
#include <algorithm>
#include <iostream>

int main() {
   using namespace std;

   list <int> L;
   list <int>::iterator Iter;
   
   
   L.push_back( 40 );
   L.push_back( 20 );
   L.push_back( 10 );
   L.push_back( 30 );
   L.push_back( 0 );

   cout << "L = ( " ;
   for ( Iter = L.begin( ) ; Iter != L.end( ) ; Iter++ )
      cout << *Iter << " ";
   cout << ")" << endl;

   list <int>::reverse_iterator result;
   result = find( L.rbegin( ), L.rend( ), 0 );
   if  ( result == L.rend( ) )
      cout << "There is no 0 in list L.";
   else {
      cout << "There is a 0 in list L";
      if ( ++result != L.rend() )
         cout << " and it is followed by a " << *result << ".";
   }
   cout << endl;
}