View difference between Paste ID: WGU806R9 and nitHVh1C

 #include <iostream>
 #include <stdexcept>
 #include <vector>
 
 using namespace std;
 
 class Tower {
 public:
 
     Tower(int disks_num) {
         FillTower(disks_num);
     }
     int GetDisksNum() const {
         return disks_.size();
     }
     void SetDisks(int disks_num) {
         FillTower(disks_num);
     }
 
     void AddToTop(int disk) {
         int top_disk_num = disks_.size() - 1;
         if (0 != disks_.size() && disk >= disks_[top_disk_num]) {
             throw invalid_argument("Unable to put a big disk on a small one");
         } else {
             disks_.push_back(disk);
         }
     }
 
     void TopTransfer(Tower& destination){
         auto Top = disks_[disks_.size() - 1];
         disks_.erase(end(disks_) - 1);
         destination.AddToTop(Top);
     }
 
     void MoveDisks(int disks_num, Tower& destination, Tower& buffer) {
         if (disks_num<=0) {
             return;
         }else{
             MoveDisks(disks_num - 1, buffer, destination);
             TopTransfer(destination);
             buffer.MoveDisks(disks_num - 1, destination, *this);
         }
  }
 private:
     vector<int> disks_;
 
     void FillTower(int disks_num) {
         for (int i = disks_num; i > 0; i--) {
             disks_.push_back(i);
         }
     }
 };
 
 void SolveHanoi(vector<Tower>& towers) {
     int disks_num = towers[0].GetDisksNum();
     towers[0].MoveDisks(disks_num, towers[2], towers[1]);
 }
 
 int main() {
     int towers_num = 3;
     int disks_num = 3;
     vector<Tower> towers;
     for (int i = 0; i < towers_num; ++i) {
         towers.push_back(0);
     }
     towers[0].SetDisks(disks_num);
     SolveHanoi(towers);
 }