leetcode707

Posted AsenYang

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了leetcode707相关的知识,希望对你有一定的参考价值。

数据结构的题,从网上找到的实现方式,先记录下来。

class MyLinkedList {
public:
    /** Initialize your data structure here. */
    MyLinkedList() {
        LinkedList = 0;

    }
    ListNode *LinkedList;
    /** Get the value of the index-th node in the linked list. If the index is invalid, return -1. */
    int get(int index) {
        int i = 0;        
        ListNode *head = LinkedList;        
        while (head&&i<index) {            
            head = head->next;            
            i++;        
        }        
        if (head&&i == index) 
            return head->val;        
        else 
            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) {
        ListNode *head = (ListNode *)malloc(sizeof(ListNode));
        head->next = LinkedList;
        head->val = val;
        LinkedList = head;
    }
    
    /** Append a node of value val to the last element of the linked list. */
    void addAtTail(int val) {
        ListNode *head = LinkedList;        
        ListNode *tmp = (ListNode *)malloc(sizeof(ListNode));        
        tmp->next = 0;        
        tmp->val = val;        
        if (!head) 
        {            
            LinkedList = tmp;            
            return;        
        }        
        while (head->next) 
        {            
            head = head->next;        
        }        
        head->next =  tmp;

    }
    
    /** 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) {
        int i = 0;        
        ListNode *head = LinkedList;        
        if (!head&&index==0) 
        {            
            ListNode *tmp = (ListNode *)malloc(sizeof(ListNode));            
            tmp->val = val;            
            tmp->next = 0;            
            LinkedList = tmp;            
            return;        
        }        
        while (head&&i<index - 1) 
        {            
            head = head->next;            
            i++;        
        }        
        if (head&&head->next == 0) 
        {            
            ListNode *tmp = (ListNode *)malloc(sizeof(ListNode));            
            tmp->val = val;            
            tmp->next = 0;            
            head->next = tmp;        
        }        
        else if (i == index - 1 && head&&head->next) 
        {            
            ListNode *tmp = (ListNode *)malloc(sizeof(ListNode));            
            tmp->val = val;            
            tmp->next = head->next;            
            head->next = tmp;        
        }
    }
    
    /** Delete the index-th node in the linked list, if the index is valid. */
    void deleteAtIndex(int index) {
        ListNode *head = LinkedList;        
        int i = 0;        
        while (head&&i<index - 1)
        {            
            head = head->next;            
            i++;        
        }        
        if (head == 0) 
            return;        
        if (head->next == 0 && index == 0) 
        {
            //只有一个节点的情况            
            LinkedList = 0;            
            return;        
        }        
        if (head->next) 
        {            
            ListNode *tmp = head->next;            
            head->next = tmp->next;            
            free(tmp);        
        }

    }
};

/**
 * 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);
 */

 

以上是关于leetcode707的主要内容,如果未能解决你的问题,请参考以下文章

707链表-设计链表

707链表-设计链表

LeetCode 707 设计链表[链表] HERODING的LeetCode之路

图解 LeetCode 707一题学会链表的 5 种操作。

图解 LeetCode707:一题学会链表的 5 种操作。

Java算法 每日一题 编号707:设计链表