⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 main.cpp

📁 ssd5 考试2.下下来对你一定有帮助的
💻 CPP
字号:
#pragma warning(disable:4786)

#include <iostream>
#include <fstream>
#include <cstdlib>
#include <string>
#include <stack>
#include <stdexcept>
#include <vector>
#include <algorithm>

#include "car.h"

using namespace std;

const int PARKING_SPOTS_PER_AISLE = 3;
const int NUMBER_OF_AISLES = 5;

void handle_arrival(vector<Car>&, vector<stack<string> >&, const string&);
void handle_departure(vector<Car>&, vector<stack<string> >&, const string&);
Car& find_car(vector<Car>&, string);

int main(int argc, char* argv[]) {

    try {

        if (argc != 2) {
            cerr << "Usage:\n" << argv[0] << " data-file";
            return EXIT_FAILURE;
        }    

        ifstream inf(argv[1]);
        if (! inf) {
            cerr << "Could not open " << argv[1];
            return EXIT_FAILURE;
        }

		vector<Car> cars;
		vector< stack<string> > parking_lot(NUMBER_OF_AISLES);

        while (! inf.eof()) {
        
            string action, plate;
            inf >> plate >> action;
        
            if (action == "arrives") {
                handle_arrival(cars, parking_lot, plate);
            } 
            else if (action == "departs") {
                handle_departure(cars, parking_lot, plate);            
            } else {
                cerr << "Unknown action: " << action << endl;
            }
        
        }
        inf.close();    

        cout << "\nHere are all the cars that visited the lot today:\n";

        // TODO: Output the license plates of all the
        // cars that visited the lot, in alphabetical order	
		sort(cars.begin(),cars.end());
		vector<Car>::iterator itr;
		for(itr = cars.begin(); itr != cars.end(); itr++)
		{
			cout << itr->getPlate() << endl;
		}



        return EXIT_SUCCESS;
        
    }
    catch (exception& e) {
        cerr << e.what() << endl;
    }
    catch (...) {
        cerr << "Unknown exception caught!" << endl;
    }
    
    return EXIT_FAILURE;
}

void handle_arrival(vector<Car>& cars, vector< stack<string> >& parking_lot, const string& plate) {

    // TODO: Handle car arrivals
	for(int i=0;i<NUMBER_OF_AISLES;i++)
	{
		if(parking_lot[i].size()<PARKING_SPOTS_PER_AISLE)
		{
			Car car(plate,i);
			parking_lot[i].push(plate);
			cars.push_back(car);
			return;
		}
	}
	Car car(plate);
	cars.push_back(car);



}

void handle_departure(vector<Car>& cars, vector< stack<string> >& parking_lot, const string& plate) {

    // TODO: Handle car departures
	Car departCar=find_car(cars,plate);
	int aisles=departCar.getAisle();
	stack<string> temp_stack;
	while(parking_lot[aisles].top()!=plate)
	{
		temp_stack.push(parking_lot[aisles].top());
		Car& c=find_car( cars,parking_lot[aisles].top() );
		c.setTimesMoved(c.getTimesMoved()+1);
		parking_lot[aisles].pop();
	}
	cout<<parking_lot[aisles].top()<<" was Moved "
		<<find_car( cars,parking_lot[aisles].top() ).getTimesMoved()
		<<" times when it left!"<<endl;
	parking_lot[aisles].pop();
	while(!temp_stack.empty())
	{
		parking_lot[aisles].push(temp_stack.top());
		temp_stack.pop();
	}
}

Car& find_car(vector<Car>& cars, string plate) {

	// TODO: Return a reference to the 
	// the Car object whose license plate equals 
	// the parameter 'plate'
	vector<Car>::iterator itr;

	itr = find(cars.begin(), cars.end(), Car(plate)); 
	return *itr;
}

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -