python中in用于表示什么结构_Python的“ in”表示C ++的等效形式是什么？操作员？...

What is the C++ way of checking if an element is contained in an array/list, similar to what the in operator does in Python?

if x in arr:

print "found"

else

print "not found"

How does the time complexity of the C++ equivalent compare to Python's in operator?

解决方案

The time complexity of Python's in operator varies depending on the data structure it is actually called with. When you use it with a list, complexity is linear (as one would expect from an unsorted array without an index). When you use it to look up set membership or presence of a dictionary key complexity is constant on average (as one would expect from a hash table based implementation):

In C++ you can use std::find to determine whether or not an item is contained in a std::vector. Complexity is said to be linear (as one would expect from an unsorted array without an index). If you make sure the vector is sorted, you can also use std::binary_search to achieve the same in logarithmic time.

The associative containers provided by the standard library (std::set, std::unordered_set, std::map, ...) provide the member function find() for this, that will perform better than linear search, i.e., logarithmic or constant time depending on whether you have picked the ordered or the unordered alternative.

If you want to, you can use some template magic to write a wrapper function that picks the correct method for the container at hand, e.g., as presented in this answer.