LeetCode 707. Design Linked List(设计链表) -- c语言_leetcode design for linked list c-CSDN博客

本文链接：https://blog.csdn.net/d_benhua/article/details/90724420

707. Design Linked List

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.

Example:

MyLinkedList linkedList = new MyLinkedList();
linkedList.addAtHead(1);
linkedList.addAtTail(3);
linkedList.addAtIndex(1, 2);  // linked list becomes 1->2->3
linkedList.get(1);            // returns 2
linkedList.deleteAtIndex(1);  // now the linked list is 1->3
linkedList.get(1);            // returns 3

Note:

All values will be in the range of [1, 1000].
The number of operations will be in the range of [1, 1000].
Please do not use the built-in LinkedList library.

解题思路：

/*
执行用时 : 64 ms, 在Design Linked List的C提交中击败了94.00% 的用户
内存消耗 : 15.2 MB, 在Design Linked List的C提交中击败了12.40% 的用户
*/

typedef int Elemtype;

typedef struct Node{
    Elemtype data; //数据域
    struct Node *next; //指向下一个结点
} MyLinkedList;

/** Initialize your data structure here. */
MyLinkedList* myLinkedListCreate() {
    MyLinkedList *obj=(MyLinkedList *)malloc(sizeof(MyLinkedList));
    obj->next=NULL; //头结点指向空
    return obj;
}//定义了一个带头节点的单链表,并返回头指针

/** Get the value of the index-th node in the linked list. If the index is invalid, return -1. */
int myLinkedListGet(MyLinkedList* obj, int index) {
    MyLinkedList *p=obj->next;
    int j=0;
    while(p != NULL && j < index) //从第0个节点开始找到第index个结点，并用p指向第index个节点
    {
        j++;
        p=p->next;
    }
    if(p==NULL||index<0) return -1;//p指向为NULL(即第index个节点不存在)或者index无效，则返回-1;---重点考虑---
    else
    {
        return p->data;
    }
}

/** 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 myLinkedListAddAtHead(MyLinkedList* obj, int val) {
    //头插法
    MyLinkedList *p=obj,*s=(MyLinkedList *)malloc(sizeof(MyLinkedList));
    s->data=val;
    s->next=p->next;
    p->next=s;
}

/** Append a node of value val to the last element of the linked list. */
void myLinkedListAddAtTail(MyLinkedList* obj, int val) {
    //尾插法
    MyLinkedList *p=obj;
    
    MyLinkedList *s=(MyLinkedList *)malloc(sizeof(MyLinkedList));
    s->data=val;
    s->next=NULL; //尾结点指向空
    
    while(p->next!=NULL) //找到尾结点
    {
        p=p->next;
    }
    p->next=s;
}

/** 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 myLinkedListAddAtIndex(MyLinkedList* obj, int index, int val) {
    MyLinkedList *p=obj->next,*q=obj;
    int j=0;
    
    while(p != NULL && j < index)//从第0个节点开始找到第index个结点，并用p指向第index个节点，q指向第index个的前驱结点
    {
        j++;
        p=p->next;
        q=q->next;
    }
    if(p!=NULL||j>=index)//---重点考虑--- p！=NULL时插入，j==index时插入即index为最后一个节点的下一个节点，p==NULL&&index<=0时插入即单链表没有结点
    //if单链表没有结点，index<=0时插入，index>0时不插入；if index>链表长度即p==NULL时，则不插入（if index为最后一个节点的下一个节点，则插在最后即index等于链表长度）
    {
        p=(MyLinkedList *)malloc(sizeof(MyLinkedList));
        p->data=val;
        p->next=q->next;
        q->next=p;
    }
}
/** Delete the index-th node in the linked list, if the index is valid. */
void myLinkedListDeleteAtIndex(MyLinkedList* obj, int index) {
    int j=0;
    MyLinkedList *p = obj->next,*q = obj;
    while(p!=NULL&&j<index)//从第0个节点开始找到第index个结点，并用p指向第index个节点，q指向第index个的前驱结点
    {
        j++;
        p = p->next;
        q = q->next;
    }
    //if(p==NULL||j>index) return;
    //else
    if(p!=NULL&&index>=0)//第index个结点存在，则删除,index<0即index为无效值，则不删除
    {
        q->next=p->next;
        free(p);
        p = q->next;
    }
}

void myLinkedListFree(MyLinkedList* obj) {
    MyLinkedList *p=obj,*q=p->next;
    while(q!=NULL)
    {
        free(p);
        p=q;
        q=q->next;
    }
    free(p);//释放最后一个结点
    
}

/**
 * Your MyLinkedList struct will be instantiated and called as such:
 * struct MyLinkedList* obj = myLinkedListCreate();
 * int param_1 = myLinkedListGet(obj, index);
 * myLinkedListAddAtHead(obj, val);
 * myLinkedListAddAtTail(obj, val);
 * myLinkedListAddAtIndex(obj, index, val);
 * myLinkedListDeleteAtIndex(obj, index);
 * myLinkedListFree(obj);
 *
 **/
/*
["MyLinkedList","addAtHead","addAtTail","addAtIndex","get","deleteAtIndex","get"]
[[],[1],[3],[1,2],[0],[1],[-1]]

["MyLinkedList","get","addAtIndex","get","get","addAtIndex","addAtIndex","get","deleteAtIndex","deleteAtIndex","addAtIndex","get"]
[[],[0],[1,2],[0],[1],[0,1],[1,2],[0],[0],[1],[2,4],[1]]

["MyLinkedList","addAtIndex","get","deleteAtIndex"]
[[],[-1,0],[0],[-1]]
预期：[null,null,0,null]

["MyLinkedList","addAtHead","addAtTail","addAtIndex","get","deleteAtIndex","get"]
[[],[1],[3],[1,2],[1],[0],[0]]

["MyLinkedList","get","addAtIndex","get","get","addAtIndex","get","get"]
[[],[0],[1,2],[0],[1],[0,1],[0],[1]]

测试用例，对index为0的删除
["MyLinkedList","addAtHead","deleteAtIndex","get"]
[[],[1],[0],[0]]

["MyLinkedList","addAtHead","addAtTail","addAtIndex","get","deleteAtIndex","get"]
[[],[1],[3],[4,2],[1],[-1],[1]]
预期：[null,null,null,null,3,null,3]

["MyLinkedList","addAtHead","addAtHead","deleteAtIndex","addAtIndex","addAtTail","addAtIndex","addAtTail","addAtHead","addAtHead","addAtHead","addAtTail","addAtTail","addAtHead","addAtTail","addAtTail","addAtHead","addAtTail","deleteAtIndex","addAtTail","addAtTail","get","addAtIndex","addAtHead","get","get","addAtHead","get","addAtIndex","addAtTail","addAtIndex","addAtHead","addAtHead","addAtHead","get","addAtHead","addAtIndex","addAtTail","addAtHead","addAtIndex","get","addAtTail","addAtTail","addAtIndex","addAtIndex","addAtHead","addAtHead","get","addAtTail","addAtIndex","addAtIndex","addAtHead","deleteAtIndex","addAtIndex","addAtHead","deleteAtIndex","addAtTail","deleteAtIndex","addAtTail","addAtHead","addAtTail","addAtTail","addAtHead","addAtTail","addAtIndex","deleteAtIndex","addAtHead","addAtHead","addAtHead","addAtTail","get","addAtIndex","addAtTail","addAtTail","addAtTail","deleteAtIndex","get","addAtHead","get","get","addAtTail","deleteAtIndex","addAtTail","addAtIndex","addAtHead","addAtIndex","addAtTail","get","addAtIndex","addAtIndex","addAtHead","addAtHead","get","get","get","addAtIndex","addAtHead","addAtIndex","addAtHead","addAtTail","addAtIndex","get"]
[[],[38],[45],[2],[1,24],[36],[3,72],[76],[7],[36],[34],[91],[69],[37],[38],[4],[66],[38],[14],[12],[32],[5],[7,5],[74],[7],[13],[11],[8],[10,9],[19],[3,76],[7],[37],[99],[10],[12],[1,20],[29],[42],[21,52],[11],[44],[47],[6,27],[31,85],[59],[57],[4],[99],[13,83],[10,34],[48],[9],[22,64],[69],[33],[5],[18],[87],[42],[1],[35],[31],[67],[36,46],[23],[64],[81],[29],[50],[23],[36,63],[8],[19],[98],[22],[28],[42],[24],[34],[32],[25],[53],[55,76],[38],[23,98],[27],[18],[44,27],[16,8],[70],[15],[9],[27],[59],[40,50],[15],[11,57],[80],[50],[23,37],[12]]

*/