0

我正在解决格雷码问题。我使用递归调用制定了我的逻辑。一切看起来都不错，但我不知道如何为数组的每个元素添加前缀“0”或“1”。例如）前缀 0 : { 00, 01, 11, 10 } -> { 000, 001, 011, 010 } 或前缀 1 : { 00, 01, 11, 10 } -> { 100, 101, 111, 110 }

#include<stdio.h>
#include<string.h>
#include<math.h>

int grayCode(int list[], int bit)
{
    int listLen = strlen(list); // calculate received array length
    int revList[] = { 0 };
    int newList[] = { 0 };

    if (listLen < pow(2, bit)) // If the received array length is below 2^bit, proceed below.

    {
        for (int i = 0; i < listLen; i++) // create a reverse order array
        {
            revList[i] = list[listLen - i];
        }

        for (int i = 0; i < listLen; i++) // prefix 0 to each element of an received array, I know this doesn't work. How should I do it??
        {
            list[i] = "0" + list[i];
        }

        for (int i = 0; i < listLen; i++) // prefix 1 to each element of an reverse array, I know this doesn't work. How should I do it??
        {
            revList[i] = "1" + revList[i];
        }

        for (int i = 0; i < listLen; i++)  // put all elements of received array in the new array
        {
            newList[i] = list[i];
        }

        for (int i = 0; i < listLen; i++)  // put all elements of reverse array in the new array
        {
            newList[listLen + i] = revList[i];
        }

        for (int i = 0; i < listLen * 2; i++)  // print all elements in a new array
        {
            printf("%d bit Gray Code is { ", bit);
            printf("%d, ", newList[i]); 
            printf("}\n");
        }

        grayCode(newList, bit); // Recursive call
    }

    else if (listLen == pow(2, bit)) // If the received array length is same as 2^bit, return.
    {
        return 0;
    }
}

int main(void)
{
    int initList[2] = { 0, 1 };
    int bit;

    printf("Which bit of gray-code do you want? : ");
    scanf_s("%d", &bit);

    while (bit < 1)
    {
        printf("Input an integer bigger than 1 : ");
        scanf_s("%d", &bit);
    }

    if (bit == 1)
    {
        printf("1 bit Gray Code is { 0, 1 }\n");
    }

    else if (bit > 1)
    {
        grayCode(initList, bit);
    }

    return 0;
}
4

1 回答 1

2

不，您不能0作为前缀附加到整数。
以 开头的整数0被假定为相应十进制整数的八进制表示，即：

(037) 8 == (31) 10

如果您真的想保存带有前缀0s 的数字，则必须将数字存储为字符串。

您可以使用临时字符串来存储中间体。

该算法将是：

char str[10] = "01";      // To be converted to 001
char temp[10];

strcpy(temp, "0");     // temp = "0", str = "01"
strcat(temp, str);     // temp = "001", str = "01"
strcpy(str, temp);     // temp = "001", str = "001"
于 2014-05-06T09:27:07.207 回答