算法第六周26&203

26.Remove Duplicates from Sorted Array

Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.

Do not allocate extra space for another array, you must do this in place with constant memory.

For example,
Given input array nums = [1,1,2],

Your function should return length = 2, with the first two elements of nums being 1 and 2 respectively. It doesn’t matter what you leave beyond the new length.

---

203.Remove Linked List Elements

Remove all elements from a linked list of integers that have value val.

Example
Given: 1 –> 2 –> 6 –> 3 –> 4 –> 5 –> 6, val = 6
Return: 1 –> 2 –> 3 –> 4 –> 5

---

Solution

这两道题与上一道Remove Element极其相似，26题是删除重复的就是不断更改val，而203题只不过是处理链表，需要注意指针的问题。

class Solution {
public:
    int removeDuplicates(vector<int>& nums) {
        if (nums.size() == 0) return 0;
        int count = 1;
        int flag = nums[0];
        for (int i = 1; i < nums.size(); i++ ) {
            if (nums[i] != flag) {
                nums[count] = nums[i];
                flag = nums[i];
                count++;
            }
        }
        return count;
    }
};


/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* removeElements(ListNode* head, int val) {
ListNode* p = new ListNode(0);
p->next = head;
ListNode* temp = head;
ListNode* q = p;
ListNode* t;
while(temp != NULL) {
if (temp->val == val) {
t = temp;
q->next = temp->next;
temp = q->next;
delete t;
} else {
temp = temp->next;
q = q->next;
}
}
return p->next;
}
};