zoukankan      html  css  js  c++  java
  • #Leetcode# 707. Design Linked List

    https://leetcode.com/problems/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 nextval 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.

    代码:

    class MyLinkedList {
    public:
        /** Initialize your data structure here. */
        MyLinkedList() {
            head = NULL;
            sz = 0;
        }
        
        /** Get the value of the index-th node in the linked list. If the index is invalid, return -1. */
        int get(int index) {
            if(index < 0 || index >= sz) return -1;
            ListNode *cur = head;
            for(int i = 0; i < index; i ++) cur = cur -> next;
            return cur -> 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. */
        void addAtHead(int val) {
            ListNode *pre = new ListNode(val, head);
            head = pre;
            sz ++;
        }
        
        /** Append a node of value val to the last element of the linked list. */
        void addAtTail(int val) {
            ListNode *pre = head;
            while(pre -> next) pre = pre -> next;
            pre -> next = new ListNode(val, NULL);
            sz ++;
        }
        
        /** 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) {
            if(index < 0 || index > sz) return;
            if(index == 0) {
                addAtHead(val);
                return;
            }
            ListNode *pre = head;
            for(int i = 0; i < index - 1; i ++) pre = pre -> next;
            ListNode *cur = new ListNode(val, pre -> next);
            pre -> next = cur;
            sz ++;
        }
        
        /** Delete the index-th node in the linked list, if the index is valid. */
        void deleteAtIndex(int index) {
            if(index < 0 || index >= sz) return;
            if(index == 0) {
                head = head -> next;
                sz --;
                return;
            }
            
            ListNode *pre = head;
            for(int i = 0; i <index - 1; i ++) pre = pre -> next;
            pre -> next = pre -> next -> next;
            sz --;
        }
    private:
        struct ListNode {
            int val;
            ListNode *next;
            ListNode(int x, ListNode *n): val(x),next(n) {}
        };
        ListNode *head, *tail;
        int sz;
    };
    
    
    /**
     * 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);
     */
    

      这个写完之后仿佛已经搞清楚了链表 但愿不是错觉叭

  • 相关阅读:
    [转]如何让ruby中的ri起作用
    大四中软实习笔记20130304
    VC6.0: fatal error C1010: unexpected end of file while looking for precompiled head
    大四中软实习笔记20130307
    C++ odbc 连接数据库错误 在指定的 DSN 中,驱动程序和应用程序之间的体系结构不匹配
    大四中软实习笔记20130303
    VC6.0: unresolved external symbol "public
    【分布式锁的演化】什么是锁?
    【分布式锁的演化】常用锁的种类以及解决方案
    【数据库】海量数据切分方案
  • 原文地址:https://www.cnblogs.com/zlrrrr/p/10296375.html
Copyright © 2011-2022 走看看