刨光机单片机源代码 - - Powered by Discuz!

#include<REG52.h>
#define MAXSIZE 100
using namespace std;
typedef int ElemType;
typedef struct Node
{
ElemType data;
int cur;
} StaticLinkList[MAXSIZE];
bool InitList(StaticLinkList array)
{
cout << "InitList..." << endl;
for (int i = 0; i < MAXSIZE - 2; i++)
{
array[i].cur = i + 1;
}
20;
array[MAXSIZE - 1].cur = 0;
return true;
}
int Malloc_SLL(StaticLinkList array)
{
int k = array[0].cur;
if (k)
array[0].cur = array[k].cur;
return k;
}
void Free_SLL(StaticLinkList array, int pos)
{
array[pos].cur = array[0].cur;
array[0].cur = pos;
}
int ListLength(StaticLinkList array)
{
int i = array[MAXSIZE - 1].cur;
int j = 0;
while(i)
{
i = array[i].cur;
++j;
}
return j;
}
bool ListInsert(StaticLinkList array, int pos, ElemType Elem)
{
cout << "Insert List from pos: " << pos << " Item " << Elem << endl;
if (pos < 1 || pos > ListLength(array) + 1)
return false;
int k = MAXSIZE - 1;
int i = Malloc_SLL(array);
if (i)
{
array[i].data = Elem;
for (int l = 1; l <= pos - 1; l++)
k = array[k].cur;
array[i].cur = array[k].cur;
array[k].cur = i;
return true;
}
return false;
}
bool ListDelete(StaticLinkList array, int pos)
{
cout << "Delete List from pos: " << pos << endl;
if (pos < 1 || pos > ListLength(array))
return false;
int k = MAXSIZE - 1;
for (int l = 1; l <= pos - 1; l++)
k = array[k].cur;
int j = array[k].cur;
array[j].cur = array[pos].cur;
Free_SLL(array, j);
return true;
}
bool ListTraverse(StaticLinkList array)
{
cout << "List Traverse : " << endl;
int k = MAXSIZE - 1;
while (array[k].cur != 0)
{
k = array[k].cur;
cout << array[k].data << ' ';
}
cout << endl;
return true;
}

复制代码