C语言数据结构之顺序数组的实现

C语言数据结构之顺序数组的实现

以下为展示顺序数组的示例：

1.用C语言实现的版本

#include  
#include  
#include  
#include  
#define OK 1 //成功标志 
#define ERROR 0 //错误标志 
#define MAX_ARRAY_DIM 8 //数组最大维数 
 
typedef int ElemType; 
typedef int Status;  
typedef struct 
{ 
  ElemType *base;  
  int dim;  
  intint *bounds;  
  intint *constants;  
}Array; 
 
 
Status InitArray(Array *A, int dim, ...) 
{  
  int elemtotal = 1, i;  
  if (dim<1 || dim>MAX_ARRAY_DIM) //判断数组维数 
  { 
    return ERROR; 
  } 
  (*A).dim = dim;  
  (*A).bounds = (intint *)malloc(dim*sizeof(int));  
  if (!(*A).bounds) 
  { 
    exit(OVERFLOW); 
  } 
 
  va_list ap; 
  va_start(ap, dim); 
  for (i = 0; i < dim; ++i) 
  { 
    (*A).bounds[i] = va_arg(ap, int); 
    if ((*A).bounds[i] < 0) 
    { 
      return UNDERFLOW;  
    } 
    elemtotal *= (*A).bounds[i]; 
  } 
  va_end(ap); 
 
  (*A).base = (ElemType *)malloc(elemtotal*sizeof(ElemType)); 
  if (!(*A).base) 
  { 
    exit(OVERFLOW); 
  } 
 
  (*A).constants = (intint *)malloc(dim*sizeof(int)); 
  if (!(*A).constants) 
  { 
    exit(OVERFLOW); 
  } 
     
  (*A).constants[dim - 1] = 1; 
  for (i = dim - 2; i >= 0; --i)  
  { 
    (*A).constants[i] = (*A).bounds[i + 1] * (*A).constants[i + 1]; 
  } 
     
  return OK; 
} 
 
 
Status DestroyArray(Array *A) 
{  
  if ((*A).base) 
  { 
    free((*A).base); 
    (*A).base = NULL; 
  } 
  else 
  { 
    return ERROR; 
  } 
     
  if ((*A).bounds) 
  { 
    free((*A).bounds); 
    (*A).bounds = NULL; 
  } 
  else 
  { 
    return ERROR; 
  } 
 
  if ((*A).constants) 
  { 
    free((*A).constants); 
    (*A).constants = NULL; 
  } 
  else 
  { 
    return ERROR; 
  } 
 
  return OK; 
} 
 
 
 
Status Locate(Array A, va_list ap, intint *off)  
{ 
  int i, ind; 
  *off = 0; 
  for (i = 0; i < A.dim; ++i) 
  { 
    ind = va_arg(ap, int); 
    if (ind < 0 || ind >= A.bounds[i]) 
    { 
      return OVERFLOW; 
    } 
    *off += A.constants[i] * ind; 
  } 
  return OK; 
} 
 
 
Status Value(ElemType *e, Array A, ...) 
{ 
  va_list ap; 
  Status result; 
  int off; 
  va_start(ap, A); 
  if ((result = Locate(A, ap, &off)) == OVERFLOW)  
  { 
    return result; 
  } 
  *e = *(A.base + off); 
  return OK; 
} 
 
 
Status Assign(Array *A, ElemType e, ...) 
{  
  va_list ap; 
  Status result; 
  int off; 
  va_start(ap, e); 
  if ((result = Locate(*A, ap, &off)) == OVERFLOW)  
  { 
    return result; 
  } 
  *((*A).base + off) = e; 
  return OK; 
} 
 
void main() 
{ 
  Array A; 
  int i, j, k, *p, dim = 3, bound1 = 3, bound2 = 4, bound3 = 2;  
  ElemType e, *p1; 
 
   
  InitArray(&A, dim, bound1, bound2, bound3);  
 
   
  printf("输出数组各维度的值：n "); 
  p = A.bounds; 
  for (i = 0; i < dim; ++i) 
  { 
    printf("A.bounds[%d] = %dn ", i, *(p + i)); 
  } 
  printf("n"); 
 
   
  printf("输出数组映像函数常量基数的值(相当于每一维度的权重值)：n "); 
  p = A.constants; 
  for (i = 0; i < dim; ++i) 
  { 
    printf("A.constants[%d] = %dn ", i, *(p + i)); 
  } 
  printf("nn"); 
 
  printf("%d页%d行%d列矩阵元素如下:n", bound1, bound2, bound3); 
  for (i = 0; i < bound1; ++i) 
  { 
    printf("第%d页：n", i); 
    for (j = 0; j < bound2; ++j) 
    { 
      for (k = 0; k < bound3; ++k) 
      { 
 Assign(&A, i * 100 + j * 10 + k, i, j, k);  
 Value(&e, A, i, j, k);  
 printf("A[%d][%d][%d]=%2d ", i, j, k, e);  
      } 
      printf("n"); 
    } 
    printf("n"); 
  } 
 
  p1 = A.base; 
  printf("顺序输出Array的元素n"); 
  for (i = 0; i < bound1*bound2*bound3; ++i)  
  { 
    printf("%4d", *(p1 + i)); 
    //输出换行 
    if (i % (bound2*bound3) == (bound2*bound3 - 1)) 
    { 
      printf("n"); 
    } 
  } 
 
   
  DestroyArray(&A); 
} 

运行结果如下图所示：

如有疑问请留言或者到本站社区交流讨论，感谢阅读，希望能帮助到大家，谢谢大家对本站的支持！