LeetCode 链表 707.设计链表

题目来自LeetCode 链表 707.设计链表，很多地方易出错。
注意各种边界条件、保持逻辑的严谨、

#include<iostream>
#include<string>
using namespace std;
typedef  int  ElementType;
class Node {
public:
    ElementType data;
    Node* next;
};//定义结点类
class MyLinkedList {
public:
    Node* Headptr;
    /** Initialize your data structure here. */
    MyLinkedList() {
        Headptr = new Node;
        Headptr->data = NULL;
        Headptr->next= NULL;
    }//析构函数，生成一个头部结点并初始化

    /** Get the value of the index-th node in the linked list. If the index is invalid, return -1. */
    int get(int index) {
        Node* temp = Headptr->next;
        int i = 0;
        while (temp != NULL)
        {
            if ( i== index)
            {
                return temp->data;
            }
            i++;
            temp = temp->next;
        }
        return -1;

    }

    /** 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) {
        Node *temp = Headptr->next;
        Headptr->next = new Node;
        Headptr->next->data = val;
        Headptr->next->next = temp;
    }

    /** Append a node of value val to the last element of the linked list. */
    void addAtTail(int val) {
        Node * temp = Headptr;
        while (temp->next!= NULL) {
            temp = temp->next;
        }
        temp->next = new Node;
        temp->next->data = val;
        temp->next->next = NULL;
    }

    /** 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) {
        Node* temp = Headptr;
        for (int i=0; i < index; i++)
        {
            temp = temp->next;
        }
        Node* temp1 = temp->next;
        temp->next= new Node;
        temp->next->data = val;
        temp->next->next = temp1;
    }

    /** Delete the index-th node in the linked list, if the index is valid. */
    void deleteAtIndex(int index) {
  
        Node* temp = Headptr;
        int  i = 0;
        for (; i < index; i++)
        {
            temp = temp->next;
        }
        if (i == index&&temp->next!=NULL)
        {
            Node* temp1 = temp->next;

            temp->next = temp->next->next;

            delete temp1;
        }
        else
            return;
     

    }

    void   output(MyLinkedList* obj)
    {
        Node *ptr=Headptr;
        while (ptr->next !=NULL)
        {
            cout << ptr->next->data << endl;
            ptr=ptr->next;
        }
    }
};

/**
 * Your MyLinkedList object will be instantiated and called as such:
 * MyLinkedList* obj = new MyLinkedList();
 * int param_1 = obj->get(index);
 * obj->addAtHead(val);
 * obj->addAtTail(val);
 * obj->addAtIndex(index,val);
 * obj->deleteAtIndex(index);
 */
int main() {

    MyLinkedList *obj = new MyLinkedList();
    obj->addAtHead(2);
    obj->deleteAtIndex(1);
    obj->addAtHead(2);
    obj->addAtHead(7);   
    obj->addAtHead(3);   
    obj->addAtHead(2);   
    obj->addAtHead(5);
    obj->addAtTail(5);
        obj->output(obj);
    cout<<"value 5="<<obj->get(5)<<endl;
    obj->deleteAtIndex(6);
    obj->deleteAtIndex(4);
    obj->output(obj);

	system("pause");
	return 0;
}