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);
     */
  • 相关阅读:
    Html 中 XHTML Strict 和 Transitional 的区别
    ExtJs 表单验证的方法总结
    C# 获取枚举值描述信息的方法
    VS2005查找替换插件
    自定义(手动调整).net中图像的调色板(How to adjust (customize) image's palette in .net?)
    保存Graphics对象到Bitmap对象
    javascript原生Dictionary类
    javascript中动态加载js、vbs脚本或者css样式表
    各种图像处理类库的比较及选择(The Comparison of Image Processing Libraries)
    .net中比较两幅图片是否相同
  • 原文地址:https://www.cnblogs.com/asenyang/p/9734509.html
Copyright © 2011-2022 走看看