我是这样答的(下面的代码为伪代码,不能通过编译):
void
printSList(slist
*
pList)
{
assert(pList);
if (pList == NULL)
return ;
string str;
while (pList)
{
str = string( * pList) + str;
pList = pList -> next;
}
printf( " %s " , str.c_str());
}
{
assert(pList);
if (pList == NULL)
return ;
string str;
while (pList)
{
str = string( * pList) + str;
pList = pList -> next;
}
printf( " %s " , str.c_str());
}
后来他让我想一想还有没有更为简单的方法了,当时允许我上网,我用了几分钟到网上找了一下,没有找到更好的办法,如果先把链表逆序,再顺序输出时间复杂度更高。
我走出大楼以后,忽然想到,是递归呀,对是递归:
void
printSList(slist
*
pList)
{
assert(pList);
if (pList == NULL)
return ;
if (pList -> next == NULL)
printf( " %s " , * pList);
else
{
printSList(pList -> next);
printf( " %s " , * pList);
}
}
{
assert(pList);
if (pList == NULL)
return ;
if (pList -> next == NULL)
printf( " %s " , * pList);
else
{
printSList(pList -> next);
printf( " %s " , * pList);
}
}
哎,人生中机会就是一瞬之间,错过不知道下一次又是什么时候。但只要做了就会收获,会一次比一次做的好。吃饭去了...