单向链表末尾添加结点:
struct ListNode
{
int m_nValue;
ListNode* m_pNext;
};
void Add(ListNode** pHead,int value)//如果原本没有头结点的话,那么插入的结点即为头结点,pHead要为指向指针的指针
{
ListNode* pNew = new ListNode();
pNew->m_nValue = value;
pNew->m_pNext = NULL;
if(*pHead == NULL)
{
*pHead = pNew;
}
else
{
ListNode* pNode = *pHead;
while(pNode->m_pNext != NULL)
{
pNode = pNode->m_pNext;
}
pNode->m_pNext = pNew;
}
}
删除第一个含有K值的结点:
void RemoveNode(ListNode** pHead,int value)
{
if(pHead == NULL || *pHead == NULL)
{
return;
}
ListNode* pDel = NULL;
if((*pHead)->m_nValue ==value)
{
pDel = *pHead;
*pHead = (*pHead)->m_pNext;
}
else
{
ListNode* pNode = *pHead;
while(pNode->m_pNext !=NULL && pNode->m_pNext->m_nValue !=value)
{
pNode = pNode->m_pNext;
}
if(pNode->m_pNext !=NILL && pNode->m_pNext->m_nValue == value)
{
pDel = pNode->m_pNext;
pNode->m_pNext = pNode->m_pNext->m_pNext;
}
if(pDel != NULL)
{
delete pDel;
pDel = NULL;
}
}
}
题目:输入一个链表的头结点,从尾到头反过来打印出每个结点的值。
链表结点定义如下:
struct ListNode
{
int m_nKey;
ListNode* m_pNext;
};
因为链表从后向前打印需要先遍历到最后,然后在打印,和栈非常类似,所以我们可以借助栈容器。
void Print(ListNode* pHead)
{
std::stack<ListNode*> nodes;
ListNode* pNode = pHead;
while(pNode->m_pNext != NULL)
{
nodes.push(pNode);
pNode = pNode->m_pNext;
}
while(!nodes.empty())
{
pNode = nodes.top();
printf("%d/t",pNode->m_nValue);
nodes.pop();
}
}