LeetCode 题解之Minimum Index Sum of Two Lists

1、题目描述

2.问题分析

直接是用hash table 解决问题

3、代码

vector<string> findRestaurant(vector<string>& list1, vector<string>& list2) {
       
        vector<string> result;
        map<string,int>m;
        for(int i = 0; i < list1.size() ; i++ )
        {
            m.insert( std::pair<string,int>( list1[i],i) ) ;
        }
        
        map<string,int>m2 ;
        for(int i = 0; i < list2.size() ; i++ )
        {
            m2.insert( std::pair<string,int>(list2[i],i) );
        }
        
        int min_index = list1.size() + list2.size() ;
        
        for( map<string,int>::iterator it = m.begin() ; it != m.end() ; it++ )
        {
           auto it_find = m2.find( it->first );
           if( it_find != m2.end() )
           {
               int index_sum = it->second + it_find->second;
               if( index_sum < min_index )
               {
                   result.clear();
                   result.push_back( it->first) ;
                   min_index = index_sum;
               }else if( index_sum == min_index )
               {
                   result.push_back( it->first ) ;
               }
               
           }
        }

        return result;
        
    }