We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Thoughts on this recursive solution? Is it overkill? How could it be cleaned up?
#include<cmath>#include<cstdio>#include<vector>#include<iostream>#include<algorithm>#include<memory>#include<sstream>#include<map>#include<deque>usingnamespacestd;typedefstd::pair<std::string,std::map<std::string,std::string>>Tag;std::stringparse_hrml(std::deque<Tag>hrml,std::deque<std::string>query_tags,std::stringquery_attr_key){std::stringret_val{"Not Found!"};while(!hrml.empty()){std::deque<Tag>inner_hrml;Tagfront=hrml.front();std::stringfront_tag_id=front.first;std::map<std::string,std::string>front_tag_attrs=front.second;hrml.pop_front();Tagnext=hrml.front();hrml.pop_front();while(next.first!=front_tag_id){inner_hrml.push_back(next);next=hrml.front();hrml.pop_front();}if(front_tag_id==query_tags.front()&&(query_tags.size()==1)){if(front_tag_attrs.find(query_attr_key)!=front_tag_attrs.end()){returnfront_tag_attrs.at(query_attr_key);}elseif(query_tags.size()==1){return"Not Found!";}}if(!inner_hrml.empty()){std::deque<std::string>inner_query_tags{query_tags};inner_query_tags.pop_front();if(!inner_query_tags.empty()){std::stringinner_ret_val=parse_hrml(inner_hrml,inner_query_tags,query_attr_key);if((ret_val=="Not Found!")&&(inner_ret_val!="Not Found!")){ret_val=inner_ret_val;}}}}returnret_val;}intmain(){intnum_lines;intnum_queries;std::cin>>num_lines;std::cin>>num_queries;std::cin.ignore();// Vector of tags// each tag has name and map of attrs// each attr is key-value pairstd::deque<Tag>hrml;for(inti=0;i<num_lines;i++){std::stringline;std::getline(std::cin,line);// Clean up string to make easier to parseline.erase(line.find("<"),1);line.erase(line.find(">"),1);size_tbs_pos=line.find("/");if(bs_pos!=std::string::npos){line.erase(bs_pos,1);}Tagtag;std::stringstreamss(line);ss>>tag.first;std::map<std::string,std::string>attrs;std::stringattr_key;while(ss>>attr_key){std::stringattr_val;charch;ss>>ch;ss>>attr_val;attr_val.erase(attr_val.find("\""),1);attr_val.erase(attr_val.find("\""),1);attrs.insert({attr_key,attr_val});}tag.second=attrs;hrml.push_back(tag);}for(inti=0;i<num_queries;i++){std::stringquery;std::getline(std::cin,query);std::deque<std::string>query_tags;size_tdelim_pos=query.find(".");while(delim_pos!=std::string::npos){query_tags.push_back(query.substr(0,delim_pos));query=query.substr(delim_pos+1,query.size());delim_pos=query.find(".");}delim_pos=query.find("~");query_tags.push_back(query.substr(0,delim_pos));std::stringquery_attr=query.substr(query.find("~")+1,query.size());std::cout<<parse_hrml(hrml,query_tags,query_attr)<<std::endl;}return0;}
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Attribute Parser
You are viewing a single comment's thread. Return to all comments →
Thoughts on this recursive solution? Is it overkill? How could it be cleaned up?