Leetcode41: Remove Duplicates from Sorted List

Given a sorted linked list, delete all duplicates such that each element appear onlyonce.

For example,Given1->1->2, return1->2.Given1->1->2->3->3, return1->2->3.

/** * Definition for singly-linked list. * struct ListNode { *int val; *ListNode *next; *ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public:ListNode* deleteDuplicates(ListNode* head) {if(head == NULL) return NULL;ListNode *cur = head;ListNode *next = head->next;while(next != NULL){if(next->val == cur->val){cur->next = next->next;delete next;next = cur->next;}else{cur = cur->next;next = next->next;}}return head;}};

版权声明：本文为博主原创文章，未经博主允许不得转载。

，在你生活出现失意和疲惫时能给你一点儿力量和希冀,只愿你幸福快乐。