尺上蚂蚁问题c++源码Ants On Ruler.docx

尺上蚂蚁问题 Ants On Ruler国外真实面试“回家作业”题，还是加分题。本人绝对原创，c++实现。/*4. Ants on a Ruler (Bonus)Description:N red and black ants are placed on a metre stick with some initial orientation. Every ant travels at thesame rate (1 cm/second), and will walk until they walk off an end of the ruler. However, if two ants of thesame color collide, both will reverse directions and continue walking.Given the starting location of each ant (distance from the left-most part of the ruler in centimeters),initial direction (L or R) of each ant, as well as the color of each ant (R or B), write a function thatdetermines the total distance traveled by all the ants along the ruler.Function prototype:float totalDistance(std::vectorint const locations,std::string orientation,std::string color)Example:totalDistance( {20}, L, B) = 20.0totalDistance( {20,80}, RL, RR) = 160.0*/const int L=100;//1mconst int SPEED=1;//1cm/secondstruct Ant{intiLocation;char cDirection;char cColor;intiDistance;boolbWalked;Ant(){iLocation = 0;cDirection = L;cColor = R;iDistance = 0;bWalked = false;}Ant(intiLoc, char cDir, char cClr){iLocation = iLoc;cDirection = cDir;cColor = cClr;iDistance = 0;bWalked = false;}Ant(const Ant a){iLocation = a.iLocation;cDirection = a.cDirection;cColor = a.cColor;iDistance = a.iDistance;bWalked = false;}~Ant(){};};float totalDistance(std::vectorint const locations,std::string orientation,std::string color){float iTotalDistance = 0;//initializestd::vectorAnt ants;for (inti=0;i(int)locations.size();i++){ants.push_back(Ant((int)locations[i],orientation[i],color[i]));}//remove out of range antsfor (std::vectorAnt::iterator it=ants.begin();it!=ants.end();){if (0=it-iLocation || L=it-iLocation){iTotalDistance += it-iDistance;it = ants.erase(it);}else++it;}boolbFirst = true;while(!ants.empty()){//1secondfor(std::vectorAnt::iteratoritSet=ants.begin(); itSet!=ants.end(); ++itSet){itSet-bWalked = false;}//every ant walks in 1 secondfor(inti=0;i(int)ants.size();i++){if (ants[i].bWalked) continue;boolbFoundCol