在多维向量中搜索两个特定元素

这里有两个演示程序，一个用于 2003 C++，另一个用于 2011 C++进行搜索

2003 C++

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <functional>
struct FindName : std::unary_function<bool, 
                                      const std::pair<std::string, std::string>>
{
    FindName( const std::pair<std::string, std::string> &p ) : p( p ){} 
    bool operator ()( const std::vector<std::string> &v ) const
    {
        return v.size() > 1 && 
               v[0] == p.first && v[1] == p.second;
    }
protected:
    const std::pair<std::string, std::string> p;
};
int main()
{
    const size_t N = 5;
    std::vector<std::vector<std::string>> v;
    v.reserve( N );
    const char * initial[N][3] =
    {
        { "Joan", "Williams", "30" },
        { "Mike", "Williams", "40" },
        { "Joan", "Smith", "30" },
        { "William", "Anderson", "20" },
        { "Sara", "Jon", "33" }
    };
    for ( size_t i = 0; i < N; i++ )
    {
        v.push_back( std::vector<std::string>( initial[i], initial[i] + 3 ) );
    }
    std::pair<std::string, std::string> p( "Joan", "Williams" );
    typedef std::vector<std::vector<std::string>>::iterator iterator;
    iterator it = std::find_if( v.begin(), v.end(), FindName( p ) );
    if ( it != v.end() )
    {
        for ( std::vector<std::string>::size_type i = 0; i < it->size(); ++i ) 
        {
            std::cout << ( *it )[i] << ' ';
        }
    }
    std::cout << std::endl;
}

2011 C++

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
int main()
{
    std::vector<std::vector<std::string>> v =
    {
        { "Joan", "Williams", "30" },
        { "Mike", "Williams", "40" },
        { "Joan", "Smith", "30" },
        { "William", "Anderson", "20" },
        { "Sara", "Jon", "33" }
    };
    std::pair<std::string, std::string> p( "Joan", "Williams" );
    auto it = std::find_if( v.begin(), v.end(),
                            [&]( const std::vector<std::string> &row )
                            {
                                return row.size() > 1 &&
                                       row[0] == p.first && row[1] == p.second;
                            } );
    if ( it != v.end() )
    {
        for ( const auto &s : *it ) std::cout << s << ' ';
    }
    std::cout << std::endl;
}

这两个程序的放位是

琼·威廉姆斯 30

我强烈建议您使用带有重载相等运算符的数据结构而不是vector<string>（特别是因为似乎第三个元素应该保存在整数中，而不是字符串中）。

无论如何，这是一种可能性：

auto iter = std::find_if( std::begin(a_words), std::end(a_words),
                          [] (std::vector<std::string> const& vec)
                          { return vec[0] == "Joan" && vec[1] == "Williams";};

如果列表按第一列或第二列按字典顺序排序，则可以改用二叉搜索。

截至 C++11，基于范围的 for 循环将是一个简单且可读的解决方案：

for(auto r: a_words)
    if(r[0] == "Joan" && r[1] == "Williams")
        cout << r[0] << " " << r[1] << " " << r[2] << endl;

本质上，@Columbo的答案很好，消除了C++ 11 个功能（除了初始化）：

#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
int main() {
    // Requires C++11
    std::vector<std::vector<std::string>> words = {
        { "Joan", "Williams",  "30" },
        { "Mike", "Williams", "40" },
        { "Joan", "Smith", "30" },
        { "William", "Anderson", "20" },
        { "Sara", "Jon", "33" },
    };
    // Below does not require C++11
    struct EqualName
    {
        const char* first;
        const char* second;
        EqualName(const char* first, const char* second)
        :   first(first), second(second)
        {}
        bool operator () (const std::vector<std::string>& element) {
            return element[0] == first && element[1] == second;
        }
    };
    std::vector<std::vector<std::string>>::const_iterator
    pos = std::find_if(words.begin(), words.end(), EqualName("Joan", "Smith"));
    if(pos != words.end())
        std::cout << (*pos)[0] << ' ' << (*pos)[1] << ' ' << (*pos)[2] << 'n';
}