707. Design Linked List

1，题目要求
Design your implementation of the linked list. You can choose to use the singly linked list or the doubly linked list. A node in a singly linked list should have two attributes: val and next. val is the value of the current node, and next is a pointer/reference to the next node. If you want to use the doubly linked list, you will need one more attribute prev to indicate the previous node in the linked list. Assume all nodes in the linked list are 0-indexed.

Implement these functions in your linked list class:

get(index) : Get the value of the index-th node in the linked list. If the index is invalid, return -1.
addAtHead(val) : Add a node of value val before the first element of the linked list. After the insertion, the new node will be the first node of the linked list.
addAtTail(val) : Append a node of value val to the last element of the linked list.
addAtIndex(index, val) : Add a node of value val before the index-th node in the linked list. If index equals to the length of linked list, the node will be appended to the end of linked list. If index is greater than the length, the node will not be inserted.
deleteAtIndex(index) : Delete the index-th node in the linked list, if the index is valid.

设计并实现一个具有特定功能的单链表。

2，题目思路
对于这道题，题设的几个需求可以直接通过对单链表进行操作来实现。需要注意的是，在删除节点时，对于被删除的那个节点，需要将它的next 设为NULL。

3，程序源码

class MyLinkedList {
public:
    /** Initialize your data structure here. */
    MyLinkedList() {
        head = new ListNode(0);
        tail = head;
        len = 0;
    }

    /** Get the value of the index-th node in the linked list. If the index is invalid, return -1. */
    int get(int index) {
        if(index>=len)   return -1;
        else
        {
            ListNode* tmp = head;
            for(int i = 0;i<=index;i++)
                tmp = tmp->next;
            return tmp->val;
        }
    }

    /** Add a node of value val before the first element of the linked list. After the insertion, the new node will be the first node of the linked list. */
    void addAtHead(int val) {
        ListNode* tmp = new ListNode(val);
        tmp->next = head->next;
        head->next = tmp;

        len++;
        return;
    }

    /** Append a node of value val to the last element of the linked list. */
    void addAtTail(int val) {
        tail = head;
        while(tail->next != NULL)
            tail = tail->next;  //找到列表尾部的元素
        ListNode* tmp = new ListNode(val);
        tail->next = tmp;
        tmp->next = NULL;

        len++;
        return;
    }

    /** Add a node of value val before the index-th node in the linked list. If index equals to the length of linked list, the node will be appended to the end of linked list. If index is greater than the length, the node will not be inserted. */
    void addAtIndex(int index, int val) {
        if(index > len) return;
        ListNode* tmp = head;
        ListNode* add = new ListNode(val);
        for(int i = 0;i<index;i++)
            tmp = tmp->next;
        add->next = tmp->next;
        tmp->next = add;
        len++;
        return;
    }

    /** Delete the index-th node in the linked list, if the index is valid. */
    void deleteAtIndex(int index) {
        if(index >= len) return;
        ListNode* tmp = head;
        for(int i = 0;i<index;i++)
            tmp = tmp->next;
        ListNode* del = tmp->next;
        tmp->next = del->next;
        del->next = NULL;

        len--;
        return;
    }
private:
    struct ListNode {
        int val;
        ListNode* next;
        ListNode(int x) : val(x), next(NULL) {}
    };

    int len;
    ListNode* head;
    ListNode* tail;
};