尝试运行代码时堆已损坏

当我运行我的程序时，它会中断并在调试程序时出现错误"堆已损坏"，它实际上会很好地完成整个过程并在系统上中断("暂停"(，这似乎是一个奇怪的地方出现错误。我不知道问题出在哪里。该程序运行良好，直到我为 + 和操作系统添加了运算符重载

下面是我的代码：

主要。.CPP

#include "stdafx.h"
#include "vector.h"
// the printV function
// used to test the copy constructor
// parameter: a MyVector object
void printV(Vector);

int main()
{
    cout << "nCreating a vector Sam of size 4.";
    Vector sam(4);
    cout << "nPush 12 values into the vector.";
    for (int i = 0; i < 12; i++)
        sam.push_back(i);
    cout << "nHere is sam: ";
    cout << sam;
    cout << "n---------------n";
    cout << "nCreating a vector Joe of size 4.";
    Vector joe(4);
    cout << "nPush 6 values into the vector.";
    for (int i = 0; i < 6; i++)
        joe.push_back(i * 3);
    cout << "nHere is joe: ";
    cout << joe;
    cout << "n---------------n";
    cout << "nTest the overloaded assignment operator "joe = sam": ";
    joe = sam;
    cout << "nHere is sam: ";
    cout << sam;
    cout << "n---------------n";
    cout << "nHere is joe: ";
    cout << joe;
    cout << "n---------------n";
    // pass a copy of sam by value
    printV(sam);
    system("PAUSE");
    return 0;
}
void printV(Vector v)
{
    cout << "n--------------------n";
    cout << "Printing a copy of a vectorn";
    cout << v;
}

向量。H

#pragma once
#include <iostream>
#include "stdafx.h"
using namespace std;
class Vector
{
private:
    int vectorSize;
    int vectorCapacity;
    int *vectorArray;
public:
    //A default constructor that creates an vector with a default capacity of 2
    Vector();
    //A parameterized constructor that creates a vector of capacity n
    Vector(int n);
    // A function, size(), that returns the size of your vector.
    int size();
    // A function, capacity(), that returns the capacity of the vector.
    int capacity();
    // A function, clear(), that deletes all of the elements from the vector and resets its size to zero and its capacity to two.
    void clear();
    // A function push_back(int n) that adds the integer value n to the end of the vector.If the vector is not large enough to hold this additional value, you must make the vector grow.Your grow algorithm should double the current capacity of the vector.Don't forget to consider the case where the initial capacity of the vector is zero.
    void push_back(int n);
    // A function at(int n) that returns the value of the element at position n in the vector.If the index n is greater than the size() of the vector, this function should throw an exception.
    int at(int n);
    friend ostream& operator<<(ostream& os, Vector vt);
    Vector operator=(Vector&);

向量。.CPP

#include "stdafx.h"
#include "vector.h"

Vector::Vector()
{
    vectorSize = 0;
    vectorCapacity = 0;
    vectorArray = 0;
}
// Create new array with given capacity
Vector::Vector(int n) 
{
    vectorCapacity = n;
    vectorArray = new int[vectorCapacity];
}
//Return array size
int Vector::size() 
{
    return vectorSize;
}
// Return array capacity
int Vector::capacity()
{
    return vectorCapacity;
}
// clear array values
void Vector::clear()
{
    for (int i = 0; i < sizeof(vectorArray); i++)
    {
        vectorArray[i] = '';
    }
    vectorSize = 0;
    vectorCapacity = 2;
}

// Add number to array and double array size if needed
void Vector::push_back(int n)
{
    int test = 100;
    if (vectorCapacity > vectorSize)
    {
        vectorArray[vectorSize] = n;
        vectorSize++;
    }
    else {
        if (vectorCapacity == 0) {
            vectorArray = new int[4];
            vectorArray[0] = n;
            vectorCapacity = 4;
            vectorSize++;
        }
        else {
            int newCapacity = vectorCapacity * 2;
            // Dynamically allocate a new array of integers what is somewhat larger than the existing array.An algorithm that is often used is to double the size of the array.
            int *tempArray = new int[newCapacity];
            // Change capacity to be the capacity of the new array.
            vectorCapacity = newCapacity;
            // Copy all of the numbers from the first array into the second, in sequence.
            for (int i = 0; i < Vector::size(); i++)
            {
                tempArray[i] = vectorArray[i];
            }
            delete[] vectorArray;
            vectorArray = new int[newCapacity];
            for (int i = 0; i < Vector::size(); i++)
            {
                vectorArray[i] = tempArray[i];
            }
            delete[] tempArray;
            // Add the new element at the next open slot in the new array.
            vectorArray[vectorSize] = n;
            // Increment the size;
            vectorSize++;
        }
    }
}

// Return Value and given point in array
int Vector::at(int n)
{
    return vectorArray[n];
}
// Cout Vector
ostream& operator<<(ostream& os, Vector vt)
{
    int size = vt.size();
    for (int i = 0; i < size; i++) {
        os << "index " << i << " is " << vt.at(i) << endl;
    }
    return os;
}
// Set one vector to equil another
Vector Vector::operator=(Vector& right) {
    // Clear array on left
    for (int i = 0; i < sizeof(vectorArray); i++)
    {
        vectorArray[i] = '';
    }
    vectorSize = right.size();
    vectorCapacity = right.size() * 2;
    // Assign values from left to right
    for (int i = 0; i < vectorSize; i++)
    {
        vectorArray[i] = right.at(i);
    }
    return vectorArray[0];
}