首页 > 代码库 > LeetCode OJ 83. Remove Duplicates from Sorted List
LeetCode OJ 83. Remove Duplicates from Sorted List
Given a sorted linked list, delete all duplicates such that each element appear only once.
For example,
Given 1->1->2
, return 1->2
.
Given 1->1->2->3->3
, return 1->2->3
.
Subscribe to see which companies asked this question
解答
这题太水了,注意不要对NULL解引用就好了。
/** * Definition for singly-linked list. * struct ListNode { * int val; * struct ListNode *next; * }; */ struct ListNode* deleteDuplicates(struct ListNode* head) { struct ListNode *pNode = head; while(NULL != pNode&&NULL != pNode->next){ if(pNode->val == pNode->next->val){ pNode->next = pNode->next->next; } else{ pNode = pNode->next; } } return head; }
LeetCode OJ 83. Remove Duplicates from Sorted List
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。