在ubuntu下,用gdb调试,代码写完,出现两个错误,一是忘记给head分配空间,导致内存错误,二是 upsideList 函数中count从0开始了,以至于少输出一个值。
昨天面试做这题,手写代码,写着写着有点懵。第一次手写代码,而且上大学以来,第一次为了写代码而写代码,最后紧张得竟把思路都忘了。本来不想再写这题了,但看到剑指offer上有,但只有C++的实现,那就自己写个C的吧。。。以后要努力努力再努力!
#include "stdio.h"
#include "malloc.h"
struct listNode
{
struct listNode* next;
int nodeData;
};
int listData[] = {5,52,4,6,2,445,6,1,52,465,1};
void buildList(struct listNode* head)
{
int i=1;
struct listNode* tmp,*tmpold;
int count = sizeof(listData)/4;
head->nodeData = listData[0];
tmpold = head;
for(;i<count;i++)
{
tmp = (struct listNode*) malloc (sizeof (struct listNode));
tmp->nodeData = listData[i];
tmpold->next = tmp;
tmpold = tmp;
}
tmp -> next = NULL;
}
void upsideList(struct listNode* head)
{
if(head == NULL)
return;
int count = 1;
struct listNode * tmp,*tmpold;
tmp = head;
while(tmp->next)
{
count++;
tmp = tmp->next;
}
int store[count],i = 0;
tmpold = head;
store[0] = head->nodeData;
for(i=1;i<count;i++)
{
tmp = tmpold->next;
store[i] = tmp->nodeData;
tmpold = tmp;
}
for(i=count-1;i>=0;i--)
{
printf("store[%d] is %d\n",i,store[i]);
}
}
int main(void)
{
struct listNode* list;
list = (struct listNode*) malloc(sizeof(struct listNode));
buildList(list);
upsideList(list);
return 1;
}