File size: 1,905 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 130 131 132 133 134 135 136 137 138 139 140 141 142 |
class Circular{
Node first,last,t;
static class Node{
int data;
Node next;
}
void create(int a[], int n){
first = new Node();
first.data = a[0];
first.next = first;
last = first;
for(int i=1;i<n;i++){
t = new Node();
t.data = a[i];
t.next = last.next;
last.next = t;
last = t;
}
}
int Length(Node n){
int len= 0;
do{
len++;
n = n.next;
}while(n!=first);
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 = t;
if(index == 0){
if(first == null){
first = t;
first.next = first;
}
else{
while(n.next!=first){
n = n.next;
}
n.next = t;
t.next = first;
first = t;
}
}
else{
for(int i=0;i<index-1;i++){
n = n.next;
}
t.next = n.next;
n.next = t;
}
}
void Delete(Node p, int index){
Node q;
int x;
if(index<0 || index>Length(p)){
return;
}
if(index ==1){
while(p.next!=first){
p = p.next;
}
x = first.data;
if(p==first){
first = null;
}
else{
p.next = first.next;
first = p.next;
}
}
else{
for(int i=0;i<index-2;++i){
p = p.next;
}
q = p.next;
p.next =q.next;
x = q.data;
}
}
void Display(Node n){
do{
System.out.print(n.data+" ");
n = n.next;
}while(n!=first);
}
public static void main(String[] args){
Circular l = new Circular();
int a[]={1,2,3,4};
int n = a.length;
l.create(a,n);
l.Insert(l.first,4,32);
l.Delete(l.first,2);
l.Display(l.first);
}
}
|