zoukankan      html  css  js  c++  java
  • 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);
     */
  • 相关阅读:
    【BZOJ5306】染色(HAOI2018)-容斥原理+NTT
    【BZOJ3129】方程(SDOI2013)-容斥原理+扩展Lucas定理
    【BZOJ3876】支线剧情(AHOI&JSOI2014)-有上下界费用流
    【POJ1149】PIGS-最大流+优化建模
    【BZOJ1941】Hide and Seek(SDOI2010)-KD树
    【BZOJ1834】网络扩容(ZJOI2010)-最大流+费用流+拆边
    【BZOJ1927】星际竞速(SCOI2010)-费用流+拆点
    【BZOJ4872】分手是祝愿(六省联考2017)-期望DP
    【BZOJ2879】美食节(NOI2012)-费用流+拆点+动态加边
    JQ简单图片轮播
  • 原文地址:https://www.cnblogs.com/asenyang/p/9734509.html
Copyright © 2011-2022 走看看