Package g0701_0800.s0707_design_linked_list

Class MyLinkedList

java.lang.Object

g0701_0800.s0707_design_linked_list.MyLinkedList

public class MyLinkedList
extends Object

707 - Design Linked List.<p>Medium</p> <p>Design your implementation of the linked list. You can choose to use a singly or doubly linked list.<br /> A node in a singly linked list should have two attributes: <code>val</code> and <code>next</code>. <code>val</code> is the value of the current node, and <code>next</code> is a pointer/reference to the next node.<br /> If you want to use the doubly linked list, you will need one more attribute <code>prev</code> to indicate the previous node in the linked list. Assume all nodes in the linked list are <strong>0-indexed</strong>.</p> <p>Implement the <code>MyLinkedList</code> class:</p> <ul> <li><code>MyLinkedList()</code> Initializes the <code>MyLinkedList</code> object.</li> <li><code>int get(int index)</code> Get the value of the <code>index^th</code> node in the linked list. If the index is invalid, return <code>-1</code>.</li> <li><code>void addAtHead(int val)</code> Add a node of value <code>val</code> before the first element of the linked list. After the insertion, the new node will be the first node of the linked list.</li> <li><code>void addAtTail(int val)</code> Append a node of value <code>val</code> as the last element of the linked list.</li> <li><code>void addAtIndex(int index, int val)</code> Add a node of value <code>val</code> before the <code>index^th</code> node in the linked list. If <code>index</code> equals the length of the linked list, the node will be appended to the end of the linked list. If <code>index</code> is greater than the length, the node <strong>will not be inserted</strong>.</li> <li><code>void deleteAtIndex(int index)</code> Delete the <code>index^th</code> node in the linked list, if the index is valid.</li> </ul> <p><strong>Example 1:</strong></p> <p><strong>Input</strong></p> <p>[&ldquo;MyLinkedList&rdquo;, &ldquo;addAtHead&rdquo;, &ldquo;addAtTail&rdquo;, &ldquo;addAtIndex&rdquo;, &ldquo;get&rdquo;, &ldquo;deleteAtIndex&rdquo;, &ldquo;get&rdquo;]</p> <p>[ [], [1], [3], [1, 2], [1], [1], [1]]</p> <p><strong>Output:</strong> [null, null, null, null, 2, null, 3]</p> <p><strong>Explanation:</strong></p> <pre><code> MyLinkedList myLinkedList = new MyLinkedList(); myLinkedList.addAtHead(1); myLinkedList.addAtTail(3); myLinkedList.addAtIndex(1, 2); // linked list becomes 1->2->3 myLinkedList.get(1); // return 2 myLinkedList.deleteAtIndex(1); // now the linked list is 1->3 myLinkedList.get(1); // return 3 </code></pre> <p><strong>Constraints:</strong></p> <ul> <li><code>0 <= index, val <= 1000</code></li> <li>Please do not use the built-in LinkedList library.</li> <li>At most <code>2000</code> calls will be made to <code>get</code>, <code>addAtHead</code>, <code>addAtTail</code>, <code>addAtIndex</code> and <code>deleteAtIndex</code>.</li> </ul>

Constructor Summary

Constructors

Constructor	Description
MyLinkedList()

Method Summary

Modifier and Type	Method	Description
void	addAtHead(int val)
void	addAtIndex(int index, int val)
void	addAtTail(int val)
void	deleteAtIndex(int index)
int	get(int index)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

MyLinkedList

public MyLinkedList()

Method Details

get

public int get(int index)

addAtHead

public void addAtHead(int val)

addAtTail

public void addAtTail(int val)

addAtIndex

public void addAtIndex(int index,
 int val)

deleteAtIndex

public void deleteAtIndex(int index)