线性存储结构结构的思考

1 C++实现数组,带一个last(index of the last member of the array)(代替了数组的长度,使得数组更具有弹性)

class SeqList
{
private:
    int * data;
    int last; // index of the last element
public:
    SeqList ( int sz );
    ~SeqList ( )
    {
        delete [ ] data;
    }
    void input ();
    void output() ;
    void Insert   ( const int &x, int i);
}  ;

void SeqList:: input()
{
    cin >>last;
    for (int i=0; i<last; i++)
        cin>>data [i];
    last--;使得last可以继续表示数组末尾元素的index
}

2 链表的new 创建法

struct ListNode
{
    int val;
    ListNode *next;
    //ListNode(int x):val(x),next(NULL){}
};
void Create(ListNode** L,int len)
{
    ListNode* p;
    //*L=(LinkList)malloc(sizeof(ListNode));
    *L=new ListNode;
}