线性表的动态存储及插入、删除、查找、扩大操作；

有关数据结构的学习笔记，懒得整理了，直接挂上了。。。

#include<cstdio>
#include<cstdlib>
#include<iostream>
#define InitSize 10
using namespace std;
typedef struct {//Linear_list data formation
 int* data;
 int MaxSize;
 int length;
}Sqlist;
void InitList(Sqlist& L)//InitList
{
 L.data =/* (int*)malloc(InitSize * sizeof(int));*/new int[InitSize];
 L.length = 0;
 L.MaxSize = InitSize;
 int i = 0;
}
void IncreaseSize(Sqlist& L,int Addlen)//Addlength
{
 int* P = L.data;
 int i = 0;
 L.data = new int[InitSize + Addlen];
 while (i < L.length)
 {
  L.data[i++] = P[i];
 }
 L.MaxSize += Addlen;
 delete[]P;
}
bool ListDelete(Sqlist& L, int i, int& e)//Delete Elem
{
 if (i<1 || i>L.length)
  return false;
 e = L.data[i - 1];
 for (int j = i; j < L.length; j++)
  L.data[j - 1] = L.data[j];
 L.length--;//Don't forget!!
 return true;
}
bool ListInsert(Sqlist& L, int i, int e)//Insert Elem
{
 if (i<1 || i>L.length + 1)
  return false;
 if (L.length >= L.MaxSize)
  return false;
 for (int j = L.length; j >= i; j--)
  L.data[j] = L.data[j - 1];
 L.data[i - 1] = e;//Don't forget!!
 L.length++;
 return true;
}
void Getelem(Sqlist& L, int location)
{
 for (int i = 0; i < L.length; i++)
 {
  if (location == i + 1)
  {
   cout << L.data[i] <<' '<< location;
   break;
  }
  if (i ==L.length)
   cout << "num doesn't exist" << endl;
 }
}
int main()
{
 
 Sqlist L1;
 int e = -1;//return delete elem;
 InitList(L1);
 for (int j = 0; j < 5; j++)
 {
  L1.data[j] = j;
  L1.length++;
 }
 //
 //ListDelete(L1, 2, e);
 //IncreaseSize(L1, 5);
 for (int j = 0; j < L1.length; j++)
 {
  cout << L1.data[j] << endl;
 }
 //cout << e << ' ' << L1.length;
 //cout << "Elem who is Deserted is " << L1.data[1]<<endl;
 Getelem(L1, 2);
 return 0;
}