How would I find the number of keys occurring between two key values in a map ? Is there any way to accomplish this using iterators?

有帮助吗?

解决方案

Have a look at map and some STL algirhtims:

http://www.cplusplus.com/reference/stl/map/
    lower_bound Return iterator to lower bound (public member function)
    upper_bound Return iterator to upper bound (public member function) 
    distance Calculates the number of elements between first and last.
许可以下: CC-BY-SA归因
不隶属于 StackOverflow
scroll top