动态数组底层实现（入门级）

【实例截图】

【核心代码】

//2020-3-26
//yyz

#include <iostream>
#include "Array.h"
#include "Student.h"

void demo1();
void demo2();

using namespace std;

int main()
{
    demo1();
    return 0;
}
void demo2()
{
    Array<Student> arr = Array<Student>(20);
    arr.addLast(Student("Alice",100));
    arr.addLast(Student("Bob",66));
    arr.addLast(Student("Ming",88));
    arr.print();
}


void demo1()
{

    Array<int> arr1 = Array<int>();
    /*int a = arr1.getSize();
    int b = arr1.getCapacity();
    cout<< a << " "<< b <<endl;*/

    for (int i = 0; i < 10;   i)
    {
        arr1.addLast(i);
    }
    arr1.print();

    arr1.addFirst(-1);
    arr1.print();
    arr1.addLast(100);
    arr1.print();
    arr1.add(3,0);
    arr1.print();
/*    a = arr1.getSize();
    b = arr1.getCapacity();
    cout<< a << " "<< b <<endl;*/

    arr1.print();
    cout<< "arr1[12]= " <<arr1.get(12)<<endl;
    arr1.set(0,999);
    arr1.print();

    arr1.removeLast();
    arr1.print();
    arr1.remove(5);
    arr1.print();
    arr1.removeFirst();
    arr1.print();


/*    int arr[10];
    for (int i = 0; i < 10;   i) {
        arr[i]=i;
    }

    for (int j = 0; j < 10;   j) {
        cout << arr[j] << " ";
    }
    cout << endl;

    int scores[] = {100, 99, 66};
    for (int k = 0; k < sizeof(scores) / sizeof(scores[0]);   k) {
        cout << scores[k] << " ";
    }
    cout << endl;

    //在socre中遍历，类似java以及Python中遍历方法
    for (int score : scores) {
        cout << score << " ";
    }
    cout << endl;


    scores[0] = 98;
    for (int l = 0; l < sizeof(scores) / sizeof(scores[0]);   l) {
        cout << scores[l] << " ";
    }
    cout << endl;
*/

}