File size: 1,287 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 |
// This program is suitable for position based insertion
// position starts from 1
// if it was index based then , we should start index from zero
// Aurthor
//
// @Nishant Banjade
class Ins{
Node first, last,t;
static class Node{
int data;
Node next;
Node(int d){
this.data = d;
next = null;
}
}
void create(int a[], int n){
first = new Node(a[0]);
last = first;
for(int i=1; i<n; i++){
t = new Node(a[i]);
last.next = t;
last = t;
}
}
void Display(Node n){
while(n!=null){
System.out.print(n.data+" ");
n = n.next;
}
}
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;
}
if(index == 1){
t = new Node(x);
t.next = first;
first = t;
}
else{
t = new Node(x);
for(int i=2; i<=index;i++){
n = n.next;
}
t.next = n.next;
n.next = t;
}
}
public static void main(String[] args){
Ins l = new Ins();
int a[] = {1,2,3,4};
int n = a.length;
l.create(a,n);
l.Insert(l.first,0,34);
l.Display(l.first);
}
}
|