向量实现

# include 
using namespace std;

class Myvector
{
    public:
        int vCape;
        int vSize;
        int *vArr;
        void reserve(int n, bool copy)
        {
            int * newArr = new int[n];
            int i;
            if (copy == true)
            {
                for (i=0; i vArr[i+1])
                {
                    flag = 0;
                    break;
                }
            }
            return flag;
        }
        /
        void delete_back(int data)
        {
            for (int i=0; i> d;
        vec.push_back(d);
    }
    vec.print_vector();
    cout << vec.vArr << endl;
    cin >> d;
    vec.push_back(d);
    vec.print_vector();
    cout << vec.vArr << endl;
    cin >> d;
    vec.push_back(d);
    vec.print_vector();
    cout << vec.vArr << endl;  
    cout << vec.isSortVector() << endl;
    vec.pop_back();
    vec.print_vector();
    vec.pop_back();
    vec.print_vector();
    cout << vec.vArr << endl; 
    cout << vec.find_vector(9) << endl;
    for (int i=0; i<3; ++i)
    {
        vec.push_back(5);
        vec.push_back(7);
        vec.push_back(9);
        vec.push_back(1);
    }
    vec.print_vector();
    cout << vec.vArr << endl;
    cout << vec.isSortVector() << endl;
    vec.delete_back(9);
    vec.print_vector();
    vec.delete_back(1);
    vec.print_vector();
    vec.delete_back(5);
    vec.print_vector();
    vec.delete_back(7);
    vec.print_vector();
    return 0;
}