停车场管理模拟 数据结构

#include "car_stack.h" #include <iostream> using namespace std; car_stack::car_stack() { count = 0; } bool car_stack::empty() const { if(count==0) return true; else return false; } bool car_stack::full() const { if(count==max_stack) return true; else return false; } Error_code car_stack::push(const stack_entry &item) { if(full()) { return overflow; //栈满，溢出 } else { parking_lot[count].car_information= item.car_information; parking_lot[count].car_number = item.car_number; parking_lot[count].car_time = item.car_time; count++; } return success; } Error_code car_stack::pop() { if(empty()) return underflow; else { --count; } return success; } Error_code car_stack::top(stack_entry &item) const { if(empty()) return underflow; else { item = parking_lot[count-1]; } return success; } Error_code car_stack::pop_and_top(stack_entry &item) { if(count==0) return underflow; else { item = parking_lot[--count]; } return success; } int car_stack::size() const { return count; } void car_stack::clear() { count = 0; } int car_stack::find_car(stack_entry &item) { for(int i=0;i<count;i++) //遍历一遍，找出车牌号所对应的栈下标 { if(item.car_number==parking_lot[i].car_number) return i; } return -1; //没有此车，提示重新输入 } float car_stack::calculate_time(stack_entry &item,int top) //只在汽车出去时会调用此函数 { int minute = item.car_time-parking_lot[top].car_time; return (float)(minute/60.0); } void car_stack::pop_car(int top) { if(size()==1) count=0; else { for(int i=top;i<size()-1;i++) { parking_lot[i] = parking_lot[i+1]; } count--; } } void car_stack::print_stack() const { if(count==0) { cout<<"停车场内的情况为："<<endl; cout<<" 停车场内没有汽车"<<endl; } else { cout<<"停车场内的情况为："<<endl; for(int i=0;i<count;i++) { cout<<" 第"<<i+1<<"个元素为:"<<parking_lot[i].car_information<<" "<<parking_lot[i].car_number<<" "<<parking_lot[i].car_time<<endl; } } }