1–2--3–4--5–null
(递归调用)
void ReversePrintf(ListNode*head)
{
if(head)
{
ReversePrintf(head->next);
printf("%d",head->val)
}
}
1–2--3–4--5–null
(递归调用)
void ReversePrintf(ListNode*head)
{
if(head)
{
ReversePrintf(head->next);
printf("%d",head->val)
}
}