【Leetcode】【Easy】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.

解题思路：略

代码：

 /**

  * 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)

             return head;

         ListNode *p = head;

         while(p->next) {

             if (p->val == p->next->val) {

                 p->next = p->next->next;

             } else {

                 p = p->next;

             }

         }

         return head;

     }

 };

附录：

C++链表，申请和消除内存

巴特西

【Leetcode】【Easy】Remove Duplicates from Sorted List

最新文章

热门文章