代码如下:
#include <stdio.h>
int factor[3][4] =
{
{0, 1, 2, 3},
{0, 1},
{0, 1, 2},
};
int lengths[3] = {4, 2, 3};
void recurisionAccess(int factor[3][4], int lengths[3], int colum, int row)
{
int i = 0;
int j = 0;
int k = 0;
int len = 0;
int len_num = 0;
int totalLength = 1;
for (i=0; i<colum; i++)
{
totalLength *= lengths[i];
}
for (i=0; i<totalLength; i++)
{
k = i;
len_num = 0;
for (j=0; j<colum; j++)
{
len = lengths[len_num];
/* first do % with len, then do / w
#include <stdio.h>
int factor[3][4] =
{
{0, 1, 2, 3},
{0, 1},
{0, 1, 2},
};
int lengths[3] = {4, 2, 3};
void recurisionAccess(int factor[3][4], int lengths[3], int colum, int row)
{
int i = 0;
int j = 0;
int k = 0;
int len = 0;
int len_num = 0;
int totalLength = 1;
for (i=0; i<colum; i++)
{
totalLength *= lengths[i];
}
for (i=0; i<totalLength; i++)
{
k = i;
len_num = 0;
for (j=0; j<colum; j++)
{
len = lengths[len_num];
/* first do % with len, then do / w