## 题目 #

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.

• 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:

``````

``````

Note:

• All values will be in the range of [1, 1000].
• The number of operations will be in the range of [1, 1000].

## 代码 #

``````
package leetcode

}

type Node struct {
Val  int
Next *Node
Prev *Node
}

/** Initialize your data structure here. */
}

/** Get the value of the index-th node in the linked list. If the index is invalid, return -1. */
func (this *MyLinkedList) Get(index int) int {
for i := 0; i < index && curr != nil; i++ {
curr = curr.Next
}
if curr != nil {
return curr.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. */
node := &Node{Val: val}
}
}

/** Append a node of value val to the last element of the linked list. */
return
}
node := &Node{Val: val}
for curr != nil && curr.Next != nil {
curr = curr.Next
}
node.Prev = curr
curr.Next = node
}

/** 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. */
if index == 0 {
} else {
node := &Node{Val: val}
for i := 0; i < index-1 && curr != nil; i++ {
curr = curr.Next
}
if curr != nil {
node.Next = curr.Next
node.Prev = curr
if node.Next != nil {
node.Next.Prev = node
}
curr.Next = node
}
}
}

/** Delete the index-th node in the linked list, if the index is valid. */
func (this *MyLinkedList) DeleteAtIndex(index int) {
if index == 0 {
}
} else {
for i := 0; i < index-1 && curr != nil; i++ {
curr = curr.Next
}
if curr != nil && curr.Next != nil {
curr.Next = curr.Next.Next
if curr.Next != nil {
curr.Next.Prev = curr
}
}
}
}

/**
* obj := Constructor();
* param_1 := obj.Get(index); Apr 8, 2023 Edit this page