typedef struct ListNode
{
int m_value;
struct ListNode *p_next;
}ListNode; /* struct of Node */
/* add to fail of list */
void addToTail(ListNode *p_head, int value)
{
ListNode *p_node = (ListNode *)malloc(sizeof(ListNode));
if (!p_node)
{
printf("malloc failed\n");
}
p_node->m_value = value;
p_node->p_next = NULL;
if (!p_head)
{
p_head = p_node; /* 不能改变原指针的值 */
}
else
{
ListNode *p_tmp = p_head;
while(p_tmp->p_next)
{
p_tmp = p_tmp->p_next;
}
p_tmp->p_next = p_node;
}
}
/* add to fail of list */
void addToTail2(ListNode **p_head, int value)
{
ListNode *p_node = (ListNode *)malloc(sizeof(ListNode));
if (!p_node)
{
printf("malloc failed\n");
}
p_node->m_value = value;
p_node->p_next = NULL;
if (NULL == *p_head)
{
*p_head = p_node; /* 可以改变原指针的值 */
}
else
{
ListNode *p_tmp = *p_head;
while(p_tmp->p_next)
{
p_tmp = p_tmp->p_next;
}
p_tmp->p_next = p_node;
}
}
/* print the list */
void printList(ListNode *p_head)
{
ListNode *p_tmp = p_head;
if (!p_tmp)
{
printf("list is null\n");
return;
}
while(p_tmp)
{
printf("node(%d)->", p_tmp->m_value);
p_tmp = p_tmp->p_next;
}
printf("\n");
return;
}
void testlist()
{
ListNode *p_head = NULL;
addToTail(p_head, 7);
addToTail(p_head, 5);
addToTail(p_head, 3);
printList(p_head);
/* result: list is null */
}
void testlist2()
{
ListNode *p_head = NULL;
addToTail2(&p_head, 7);
addToTail2(&p_head, 5);
addToTail2(&p_head, 3);
printList(p_head);
/* result: 7->5->3 */
}
void testlist3()
{
ListNode *p_head = NULL;
addToTail2(&p_head, 7);
addToTail(p_head, 5);
addToTail(p_head, 3);
printList(p_head);
/* result: 7->5->3 */
}
int main(int argc, char* argv[])
{
testlist();
testlist2();
testlist3();
return 0;
}
关于指针的说明2——链表.c
最新推荐文章于 2020-04-09 08:47:47 发布