Menu
In the code above the else-if part gives me error. The meaning of else-if is: else if the value of x isn't in the deque then...
#include <iostream>
#include <ctime>
#include <stack>
#include <deque>
#include <algorithm>
deque<char> visited;
char x;
if (x==target[4][4])
{
visited.push_back(x);
return (visited);
}
else if (!(find(visited.begin(), visited.end(), x)))
{
visited.push_back(x);
}
ERROR:no operator "!" matches these operands
350
deque class to initialize a deque object, you can directly use the in operator to check if an item is in the deque. Copied! The collections. deque class has atomic append() , implements the popleft() method and supports indexing and membership testing.
You can directly iterate over the deque.
empty() function is used to check if the deque container is empty or not. size() function is used to return the size of the deque container or the number of elements in the deque container.
std::deque (double-ended queue) is an indexed sequence container that allows fast insertion and deletion at both its beginning and its end. In addition, insertion and deletion at either end of a deque never invalidates pointers or references to the rest of the elements.
If std::find cannot find the specific value, it will return the "end" of the iterator pair.
else if (std::find(visited.begin(), visited.end(), x) == visited.end())
{
// process the case where 'x' _is_not_ found between
// visited.begin() and visited.end()
Edit: If you want to know if x is in the deque, just reverse the condition.
else if (std::find(visited.begin(), visited.end(), x) != visited.end())
{
// process the case where 'x' _is_ found between
// visited.begin() and visited.end()
Edit: If you are unfamiliar with the iterator concept in C++, please read Understanding Iterators in the STL.
104
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With
