struct Arr
{
int * pBase;//存放的数组第一个元素的地址
int len;//数组所能容纳的最大元素的个数
int cnt;//当前数组有效元素的个数
};
void init_arr(struct Arr *, int length);
bool append_arr(struct Arr *pArr,int value);
bool insert_arr(struct Arr *pArr, int pos,int value);//pos从1开始
bool delete_arr(struct Arr *pArr, int pos,int *pVal);
int get();
bool is_empty(struct Arr *pArr);
bool is_full(struct Arr *pArr);
void sort_arr(struct Arr *pArr);
void show_arr(struct Arr *);
void inversion_arr(struct Arr *pArr);
int main()
{
struct Arr arr;
int val;
init_arr(&arr, 6);
show_arr(&arr);
append_arr(&arr, 1);
append_arr(&arr, 2);
append_arr(&arr, 3);
append_arr(&arr, 4);
if (delete_arr(&arr, 1, &val))
{
printf("删除成功\n");
printf("你删除的元素是:%d\n",val);
}
else
{
printf("删除失败");
}
//insert_Arr(&arr, 1, 99);
//printf("%d\n",arr.len);
show_arr(&arr);
inversion_arr(&arr);
printf("倒置后的数组内容\n");
show_arr(&arr);
sort_arr(&arr);
printf("排序后的数组内容\n");
show_arr(&arr);
}
void init_arr(struct Arr *pArr, int length)
{
pArr->pBase = (int*)malloc(sizeof(int)*length);
if (NULL == pArr->pBase)
{
printf("分配失败");
exit(-1);
}
else
{
pArr->len = length;
pArr->cnt = 0;
}
}
bool is_empty(struct Arr *pArr)
{
if (0 == pArr->cnt)
return true;
else
return false;
}
bool is_full(struct Arr *pArr)
{
if (pArr->cnt == pArr->len)
{
return true;
}
else
{
return false;
}
}
void show_arr(struct Arr *pArr)
{
if (is_empty(pArr))
{
printf("数组为空\n");
}
else
{
for (int i = 0; i < pArr->cnt; i++)
{
printf("%d\n", pArr->pBase[i]);
}
}
}
bool append_arr(struct Arr *pArr,int value)
{
if (is_full(pArr))
{
return false;
}
else
{
pArr->pBase[pArr->cnt] = value;
(pArr->cnt)++;
}
return true;
}
bool insert_arr(struct Arr *pArr, int pos, int value)
{
int i;
if (pos<1 || pos>pArr->cnt + 1)
{
return false;
}
for (i = pArr->cnt - 1; i >= pos - 1; i--)
{
pArr->pBase[i +1] = pArr->pBase[i];
}
pArr->pBase[pos - 1] = value;
(pArr->cnt)++;
return true;
}
bool delete_arr(struct Arr *pArr, int pos, int *pVal)
{
if (is_empty(pArr))
{
return false;
}
if (pos<1 || pos>pArr->cnt)
{
return false;
}
*pVal = pArr->pBase[pos - 1];
for (int i = pos; i < pArr->cnt; i++)
{
pArr->pBase[i - 1] = pArr->pBase[i];
}
(pArr->cnt)--;
return true;
}
void inversion_arr(struct Arr *pArr)
{
int i = 0;
int j = pArr->cnt - 1;
int t;
while (i < j)
{
t = pArr->pBase[i];
pArr->pBase[i] = pArr->pBase[j];
pArr->pBase[j] = t;
i++;
j--;
}
return;
}
void sort_arr(struct Arr *pArr)
{
int i, j, t;
for ( i = 0; i < pArr->cnt; i++)
{
for (j = i+1; j < pArr->cnt - i; j++)
{
if (pArr->pBase[i] > pArr->pBase[j])
{
t = pArr->pBase[i];
pArr->pBase[i] = pArr->pBase[j];
pArr->pBase[j] = t;
}
}
}
}
得自己无参考写出来!!!!!
2018年4月8日16:20:46(复习)
struct Arr
{
int * pBase;
int len;
int cnt;
};
void init_arr(struct Arr*, int length);
bool append_arr(struct Arr*, int value);
bool insert_arr(struct Arr*, int pos, int value);
bool delete_arr(struct Arr*, int pos, int *pVal);
bool is_empty(struct Arr*);
bool is_full(struct Arr*);
void sort_arr(struct Arr *);
void show_arr(struct Arr*);
void inversion_arr(struct Arr*);
int main()
{
struct Arr arr;
int val;
init_arr(&arr, 6);
append_arr(&arr, 1);
append_arr(&arr, 2);
append_arr(&arr, 3);
insert_arr(&arr, 2, 99);
append_arr(&arr, 4);
delete_arr(&arr, 3, &val);
show_arr(&arr);
inversion_arr(&arr);
printf("反转数组:\n");
show_arr(&arr);
sort_arr(&arr);
printf("排序数组:\n");
show_arr(&arr);
return 0;
}
void init_arr(struct Arr* pArr, int length)
{
pArr->pBase = (int*)malloc(sizeof(int)*length);
if (NULL == pArr->pBase)
{
printf("分配失败");
}
else
{
pArr->len = length;
pArr->cnt = 0;
}
}
void show_arr(struct Arr* pArr)
{
if (is_empty(pArr))
{
printf("数组为空\n");
}
else
{
for (int i = 0; i < pArr->cnt; i++)
{
printf("%d\n", pArr->pBase[i]);
}
}
}
bool is_empty(struct Arr* pArr)
{
if (0 == pArr->cnt)
return true;
else
return false;
}
bool is_full(struct Arr* pArr)
{
if (pArr->cnt == pArr->len)
{
return true;
}
else
{
return false;
}
}
bool append_arr(struct Arr* pArr, int value)
{
if (is_full(pArr))
{
return false;
}
else
{
pArr->pBase[pArr->cnt] = value;
(pArr->cnt)++;
}
return true;
}
bool insert_arr(struct Arr *pArr, int pos, int value)
{
if (pos<1 || pos>pArr->cnt + 1)
{
return false;
}
else
{
for (int i = pArr->cnt + 1; i >= pos - 1; i--)
{
pArr->pBase[i + 1] = pArr->pBase[i];
}
pArr->pBase[pos - 1] = value;
(pArr->cnt)++;
}
return true;
}
bool delete_arr(struct Arr* pArr, int pos, int* pVal)
{
if (is_empty(pArr))
{
return false;
}
if (pos<1 || pos > pArr->cnt)
{
return false;
}
*pVal = pArr->pBase[pos - 1];
for (int i = pos; i < pArr->cnt; i++)
{
pArr->pBase[i - 1] = pArr->pBase[i];
}
(pArr->cnt)--;
return true;
}
void inversion_arr(struct Arr* pArr)
{
int i=0;
int j = pArr->cnt - 1;
int t;
while (i < j)
{
t = pArr->pBase[i];
pArr->pBase[i] = pArr->pBase[j];
pArr->pBase[j] = t;
i++;
j--;
}
}
void sort_arr(struct Arr* pArr)
{
int i, j, t;
for (i = 0; i < pArr->cnt-1; i++)
{
for (j = 0; j < pArr->cnt-i-1; j++)
{
if (pArr->pBase[j] > pArr->pBase[j+1])
{
t = pArr->pBase[j];
pArr->pBase[j] = pArr->pBase[j+1];
pArr->pBase[j+1] = t;
}
}
}
}