File size: 1,726 Bytes
c574d3a |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 |
class Doubly{
Node first,last,t;
static class Node{
int data;
Node next;
Node prev;
}
void create(int a[], int n){
first = new Node();
first.data = a[0];
first.next = null;
first.prev = null;
last = first;
for(int i=1;i<n;i++){
t = new Node();
t.data = a[i];
t.next = null;
t.prev = last;
last.next = t;
last = t;
}
}
int Length(Node p){
int len=0;
while(p!=null){
len++;
p = p.next;
}
return len;
}
void Insert(Node n, int index,int x){
if(index <0 || index>Length(n))
return;
t = new Node();
t.data = x;
t.next = null;
t.prev = null;
if(index==0){
if(n==null){
first = t;
}
t.next = first;
t.prev = null;
first = t;
}
else{
for(int i=0;i<index-1;i++){
n = n.next;
}
t.next = n.next;
n.next.prev = t;
n.next = t;
}
}
void Delete(Node n, int index){
if(index<0 || index>Length(n))
return;
if(index == 0){
// head
first = first.next;
if(first!=null){
first.prev = null;
}
}
else{
for(int i=0;i<index-1;i++){
n = n.next;
}
n.prev.next = n.next;
if(n.next!=null){
n.next.prev = n.prev;
}
}
}
void Display(Node n){
while(n!=null){
System.out.print(n.data+" ");
n = n.next;
}
}
public static void main(String[] args){
Doubly l = new Doubly();
int a[] = {1,2,3,4};
int n = a.length;
l.create(a,n);
//l.Insert(l.first,0,1);
l.Delete(l.first,1);
l.Display(l.first);
}
}
|