我的代码旨在从哈希链表中读取一系列字符串,将它们全部转换为小写字母,将其放入数组以对其进行快速排序,然后将其放入称为字数统计的数据结构中,该结构包括单词及其在文档中出现的次数。当前,当我运行代码时,它会正确打印出我正在使用的打印语句,但是当我打印出代码时,其头部始终设置为null。
这是wordCount声明:
typedef struct wordCount
{
int count;
char *word;
struct wordCount* next;
} wordCount;
这是应该执行我上面描述的方法的部分。
else
{
char *toSort[curSize];
int linkedListTraverse = 0; //Array index for each linked list node
while(linkedList != NULL)
{
toSort[linkedListTraverse] = (char*) malloc(sizeof(linkedList->string));
strcpy(toSort[linkedListTraverse],linkedList->string); //Copy the data from the linked list into an array
linkedList = linkedList->next;
linkedListTraverse++;
}
int i = 0;
while(i < curSize) //Convert all of the words to lowercase
{
char* str = toSort[i];
char *p;
for (p = str; *p != '\0'; p++)
*p = (char)tolower(*p);
i++;
}
i = 0;
qsort(toSort, curSize, sizeof(char*), stringCmpFunc); //Sort the current node
while(i < curSize)
{
printf("%s\n", toSort[i]);
i++;
}
int curWordIndex = 0;
int checkWordIndex = 1;
wordCount *wordHead = NULL;
wordCount *curWord = wordHead;
while(curWordIndex < curSize)
{
curWord = (wordCount*) malloc(sizeof(wordCount));
curWord->word = toSort[curWordIndex]; //Set the word
curWord->count = 1; //Start the count out at 1
while(strcmp(toSort[curWordIndex], toSort[checkWordIndex]) == 0) //While the two words are equal
{
checkWordIndex++; //Advance the leading index check
curWord->count++;
if(checkWordIndex >= curSize) //If the leading index goes beyond the array bounds
break;
}
if(checkWordIndex < curSize)
{
curWordIndex = checkWordIndex;
checkWordIndex = curWordIndex + 1;
}
if(checkWordIndex >= curSize) //If the leading index goes beyond the array bounds
{
if(strcmp(curWord->word, toSort[curWordIndex]) != 0)
{
printf("%s %d\n", curWord->word, curWord->count);
curWord = curWord->next;
curWord = (wordCount*) malloc(sizeof(wordCount));
curWord->word = toSort[curWordIndex]; //Set the word
curWord->count = 1; //Start the count out at 1
}
break;
}
//printf("CurWordIndex: %d\n CheckWordIndex: %d\n",curWordIndex, checkWordIndex);
printf("%s %d\n", curWord->word, curWord->count);
curWord = curWord->next; //Advance to the next node in the linked list
}
printf("%s %d\n", curWord->word, curWord->count);
这是仅显示null的代码段
curWord = wordHead;
while(curWord != NULL)
{
printf("%s %d\n", curWord->word, curWord->count);
curWord = curWord->next;
}
答案 0 :(得分:1)
放入
if (wordHead == NULL) { wordHead = curWord; }
之后
curWord = (wordCount*) malloc(sizeof(wordCount));
已更新
这是另一个问题:
curWord = curWord->next;
curWord = (wordCount*) malloc(sizeof(wordCount));
应该是:
curWord->next = (wordCount*) malloc(sizeof(wordCount));
curWord = curWord->next;
注意: 请遵循rules,它将帮助我们为您提供帮助。
已更新/ 2
替换此:
while(curWordIndex < curSize) {
curWord = (wordCount*) malloc(sizeof(wordCount));
与此:
while(curWordIndex < curSize) {
wordCount* tmp = (wordCount*) malloc(sizeof(wordCount));
if (curWord) { curWord->next = tmp; }
curWord = tmp;