[Leetcode] 82, 61, 19

82. Remove Duplicates from Sorted List II

Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.

For example,
Given 1->2->3->3->4->4->5, return 1->2->5.
Given 1->1->1->2->3, return 2->3.

Solution: 直接删除掉重复的部分，注意标记当前点前一个点再前一个点方便进行删除。

链表题极易写错且不容易检查，因此注意在写的时候及时进行注释。

Code:

/**
 * 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 head;
        
        //prev_p,prev,head
        ListNode dummy(head->val-1);
        dummy.next = head;
        ListNode* prev_p = &dummy;
        head = head->next;
        if(head==NULL) return dummy.next;
        
        while(head!=NULL){
            if(head->val == prev_p->next->val){
                //delete这一系列相同的点
                int x = head->val;
                //找到第一个相异的点，用head标记它，有可能是NULL
                head = head->next;
                while(head!=NULL){
                    if(head->val!=x) break;
                    head = head->next;
                }
                //令prev_p指向相异点
                prev_p->next = head; //prev_p->point_diff
                if(head==NULL) break;
                head = head->next; //prev_p->point_diff->head
            }else{
                prev_p = prev_p->next;
                head = head->next;
            }
        }
        return dummy.next;
    }
};

61. Rotate List

Given a list, rotate the list to the right by k places, where k is non-negative.

For example:
Given 1->2->3->4->5->NULL and k = 2,
return 4->5->1->2->3->NULL.

Solution: 因为k有可能比链表长度要长，因此要对k进行模运算（k%length）。然后先将链表收尾相连，然后在找到合适的位置切断链表。

Code:

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* rotateRight(ListNode* head, int k) {
        if(head==NULL) return head;
        
        
        ListNode* cur = head;
        int size = 1;
        while(cur->next!=NULL){
            cur = cur->next;
            size++;  //计算链表节点总数
        }
        k = k%size;
        if(k==0) return head; //此时正好旋转成原本的链表，直接输出
        cur->next = head;//将链表头尾相连接起来
        
        //此时，head在第1个节点
        k = size-k-1; //k=0，需要令head指向第1个节点; 令head指向第k+1个节点
        while(k>0){
            head = head->next;
            k--;
        }
        ListNode* newhead = head->next;
        head->next = NULL;//切断循环链表，变回单链表
        
        
        return newhead;
    }
};

19. Remove Nth Node From End of List

Given a linked list, remove the nth node from the end of list and return its head.

For example,

   Given linked list: 1->2->3->4->5, and n = 2.

   After removing the second node from the end, the linked list becomes 1->2->3->5.

Note:
Given n will always be valid.
Try to do this in one pass.

Solution: 使用两个指针，令其中一个先走n步后两个指针一起走，当第一个指针到终点时，后一个指针指向待删除节点的前一个节点。

Code:

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* removeNthFromEnd(ListNode* head, int n) {
        //题目中做了变量合法的假设：head!=NULL，n>0 && n<=length
        ListNode dummy(0);
        dummy.next = head;
        ListNode* prev = &dummy;//标记需要去除的节点的前一个点
        int diff = 1;
        if(head->next==NULL) return NULL;
        while(head->next!=NULL){
            if(diff<n){
                //不够长，prev不动，head往后走
                head = head->next;
                diff++;
            }else{
                //diff==n，prev和head保持相对位置一起往后走
                head = head->next;
                prev = prev->next;
            }
        }
        prev->next = prev->next->next;
        return dummy.next;
    }
};