【python3】leetcode 707. Design Linked List （easy）

707. Design Linked List （easy） 

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 next. val 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

设计双向链表，要先有一个node的数据结构，有pre和next属性 

class ListNode(object):
    def __init__(self, x):
        self.val = x
        self.next = None
        self.prev = None

class MyLinkedList(object):

    def __init__(self):
        """
        Initialize your data structure here.
        """
        self.head ,self.tail= ListNode(0), ListNode(0)
        self.head.next = self.tail
        self.tail.prev = self.head
        self.len = 0

    def get(self, index):
        """
        Get the value of the index-th node in the linked list. If the index is invalid, return -1.
        :type index: int
        :rtype: int
        """
        #index start from 0
        if index < 0 or index >= self.len:return -1
        node = self.head.next
        for i in range(index):
            node = node.next
            
        return node.val

    def addAtHead(self, 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.
        :type val: int
        :rtype: void
        """
        node = ListNode(val)
        aft = self.head.next
        self.head.next = node
        node.prev = self.head
        node.next = aft
        aft.prev = node
        self.len += 1
        

    def addAtTail(self, val):
        """
        Append a node of value val to the last element of the linked list.
        :type val: int
        :rtype: void
        """
        node = ListNode(val)
        bfr = self.tail.prev
        bfr.next = node
        node.prev = bfr
        node.next = self.tail
        self.tail.prev = node
        self.len += 1
        

    def addAtIndex(self, 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.
        :type index: int
        :type val: int
        :rtype: void
        """
        if index <= self.len:
            bfr = self.head
            for i in range(index):
                bfr = bfr.next
            node = ListNode(val)
            aft = bfr.next
            bfr.next = node
            node.next = aft
            aft.prev = node
            node.prev = bfr
            self.len += 1

    def deleteAtIndex(self, index):
        """
        Delete the index-th node in the linked list, if the index is valid.
        :type index: int
        :rtype: void
        """
        if 0 <= index < self.len:
            node = self.head.next
            for i in range(index):
                node = node.next
            bfr = node.prev
            aft = node.next
            bfr.next = aft
            aft.prev = bfr
            self.len -= 1
                
        


# Your MyLinkedList object will be instantiated and called as such:
# obj = MyLinkedList()
# param_1 = obj.get(index)
# obj.addAtHead(val)
# obj.addAtTail(val)
# obj.addAtIndex(index,val)
# obj.deleteAtIndex(index)