class Node{
int val;
Node next;
Node prev;
public Node(){}
public Node(int val){
this.val = val;
}
}
class MyLinkedList {
int size;
Node head;
Node tail;
public MyLinkedList() {
size = 0;
head = new Node(-1);
//此处需要一个tail,不然这个双向链表就失去意义了。就和单向没区别
tail = new Node(-1);
head.prev = null;
head.next = tail;
tail.prev = head;
tail.next = null;
}
public int get(int index) {
if(index<0||index>=size)
return -1;
Node curh = head;
Node curt = tail;
if(index<=size/2){
for(int i=0;i<=index;i++){
curh = curh.next;
}
return curh.val;
}
else{
for(int i = size-1;i>=index;i--){
curt = curt.prev;
}
return curt.val;
}
}
public void addAtHead(int val) {
addAtIndex(0,val);
}
public void addAtTail(int val) {
addAtIndex(size,val);
}
public void addAtIndex(int index, int val) {
if(index > size||index<0)
return;
Node n = new Node(val);
Node cur = head;//head是大家一起用的,找一个代替修改就行
for(int i = 0;i < index;i++)
cur = cur.next;
n.next = cur.next;
n.prev = cur;
cur.next.prev = n;//差点忘了,插入的这个结点i后的结点i+1的前驱是i,而且我把n写成cur了服了
cur.next = n;
size++;
}
public void deleteAtIndex(int index) {
if(index>=size||index<0)
return;
Node cur = head;
for(int i=0;i<index;i++){
cur = cur.next;
}
cur.next = cur.next.next;//我估计这样写如果这个cur.next变成null,下面这句就不好使了。
cur.next.prev = cur;//突然觉得不会,我有tail呢
size--;
}
}
/**
* 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);
*/
也不算太难,主要是我感觉这个add和delete也可以用get那种寻找的方法用prev做,但是我太累咯,今天就到这儿了。感觉不难,也花了很久,但是对链表的理解更加深刻了
双链表是一定要有头尾的!很方便啦,以前用C++的时候觉得vector特别好用,现在java也会写咯