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);
     */
  • 相关阅读:
    并查集模板
    css margin 负值 合并盒子边框线
    滑动门原理
    精灵图制作
    css 单行文本超出用 省略号表示...
    css vertical-align 垂直对齐 解决图片空白缝隙
    css 鼠标样式 取消input 框 轮廓线 防止用户拖拽文本域
    css 显示与隐藏
    css 圆角矩形用法
    css 定位详解
  • 原文地址:https://www.cnblogs.com/asenyang/p/9734509.html
Copyright © 2011-2022 走看看