问题一:
打印1,2—n中所有满足1<=i1<i2<–<ik<=n(k<=n)的有序数组(i1, i2,—ik)并输出,要求用非递归方法解决.
代码:
#include <stdio.h>
#define N 3
#define K 1
void main()
{
int a[K] = {0};
bool TF;
int i, j;
i = 0;
TF = false;
while (1)
{
if (i == 0)
{
a[i]++;
if (a[i] > N - K + 1)
break;
}
else
{
if (TF == false)
a[i] = a[i - 1] + 1;
else
{
a[i]++;
if ((a[i] - a[i - 1]) > (N - a[i - 1]) - (K - i) + 1)
{
i--;
TF = true;
continue;
}
}
}
if (i == K - 1)
{
for (j = 0; j < K; j++)
{
printf("%d ", a[j]);
}
printf("\n");
TF = true;
continue;
}
i++;
TF = false;
}
}
问题二:打印所有n元排列,非递归解决
代码:
#include <stdio.h>
#define N 5
int first(int index, int number[]);
void main()
{
int a[N] = { 0 };
int number[N] = { 0 };
int i, j, temp;
bool TF;
i = 0;
TF = false;
while (1)
{
if (i == 0)
{
if (a[i] != 0)
number[a[i] - 1] = 0;
a[i]++;
if (a[i] > N)
break;
number[a[i] - 1] = 1;
}
else
{
temp = first(a[i], number);
if (temp == 0)
{
number[a[i] - 1] = 0;
a[i] = 0;
i--;
TF = true;
continue;
}
if (TF)
{
number[a[i] - 1] = 0;
}
a[i] = temp;
number[a[i] - 1] = 1;
if (i == N - 1)
{
for (j = 0; j < N; j++)
{
printf("%d ", a[j]);
}
printf("\n");
continue;
}
}
i++;
TF = false;
}
}
int first(int index, int number[])
{
int i;
for (i = index; i < N; i++)
{
if (number[i] == 0)
return i + 1;
}
return 0;
}
问题一的递归代码:
#include <stdio.h>
#include <malloc.h>
#include <stdlib.h>
void DY(int* p, int k, int n);
int C(int n, int k);
void L(int** p1, int row, int col, int* p2, int k, int n);
int main()
{
int a[5] = { 1, 2, 3, 4, 5 };
DY(a, 4, 5);
return 0;
}
void DY(int* p, int k, int n)
{
int** p1;
int i, j, m;
j = C(n, k);
p1 = (int**)malloc(j * sizeof(int*));
for (i = 0; i < j; i++)
p1[i] = (int*)malloc(k * sizeof(int));
L(p1, 0, 0 , p, k, n);
for (i = 0; i < j; i++)
{
for (m = 0; m < k; m++)
printf("%d", *(p1[i] + m));
printf("\n");
}
}
int C(int n, int k)
{
if (k == 0 || k == n)
return (1);
return (C(n - 1, k) + C(n - 1, k - 1));
}
void L(int** p1, int row, int col, int* p2, int k, int n)
{
int i;
if (k == 1)
{
for (i = 0; i < n; i++)
*(p1[i + row] + col) = *(p2 + i);
}
else
{
if (k == n)
{
for (i = 0; i < n; i++)
*(p1[row] + i + col) = *(p2 + i);
}
else
{
int j = row, c = 1, d = row + 1;
for (i = n - k; i >= 0; i--)
{
L(p1, j, col + 1, p2 + i + 1, k - 1, n - i - 1);
while (j < d)
{
*(p1[j] + col) = *(p2 + i);
j++;
}
if (i != 0)
{
c = (c * (n - i)) / (n - i - k + 1);
d = d + c;
}
}
}
}
}