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 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. If index is negative, the node will be inserted at the head of the list.
• 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

注意一下corner case,一定先要问清楚corner case的处理。

 1 class MyLinkedList {
 2     class Node {
 3         int val;
 4         Node next;
 5         public Node(int val) {
 6             this.val = val;
 7         }
 8     }
 9     private Node head;
10     private int size;
11 
12     /** Initialize your data structure here. */
13     public MyLinkedList() {
14         
15     }
16     
17     /** Get the value of the index-th node in the linked list. If the index is invalid, return -1. */
18     public int get(int index) {
19         if (index >= size || index < 0) return -1;
20         Node current = head;
21         for (int i = 0; i < index; i++) {
22             current = current.next;
23         }
24         return current.val;
25     }
26     
27     /** 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. */
28     public void addAtHead(int val) {
29         Node node = new Node(val);
30         node.next = head;
31         head = node;
32         size++;
33     }
34     
35     /** Append a node of value val to the last element of the linked list. */
36     public void addAtTail(int val) {
37         Node node = new Node(val);
38         size++;
39         if (head == null) {
40             head = node;
41         } else {
42             Node current = head;
43             while (current.next != null) {
44                 current = current.next;
45             }
46             current.next = node;
47         }
48     }
49     
50     /** 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. */
51     public void addAtIndex(int index, int val) {
52         if (index > size) return;
53         if (index <= 0) {
54             addAtHead(val);
55         } else {
56             size++;
57             Node current = head;
58             for (int i = 0; i < index - 1; i++) {
59                 current = current.next;
60             }
61             Node node = new Node(val);
62             node.next = current.next;
63             current.next = node;
64         }
65     }
66     
67     /** Delete the index-th node in the linked list, if the index is valid. */
68     public void deleteAtIndex(int index) {
69         if (index >= size || index < 0) return;
70         size--;
71         if (index == 0) {
72             head = head.next;
73         } else {
74             Node current = head;
75             for (int i = 0; i < index - 1; i++) {
76                 current = current.next;
77             }
78             current.next = current.next.next;
79         }
80     }
81 }

 

转载于:https://www.cnblogs.com/beiyeqingteng/p/11333754.html