SJ

• Dec 18th, 2005

 

Using Linked List and Iterator?

tania

• Dec 21st, 2005

 

List a=new ArrayList();

AKENDAR RANJIT SINGH

• Dec 26th, 2005

 

You have to use array of Object to store the element and then provide the functionality of adding,seraching and removing the element.This is the way you can create your own arrayList without using Collections.

Vivek Menon

• Jan 12th, 2006

 

LinkedList and Set are subclass of Collection and hence are Collections.Therefore using LinkedList is not a solution.Instead, u will have to create an array of Objects

rrmallik

 Profile Answers by rrmallik 

• Jan 12th, 2006

 

please tell me how this is to be done means programmatical idea of ur commrnent

vbhargava

 Profile Answers by vbhargava 

• Feb 11th, 2006

 

create you'r own class and extend the arraylsit .

sandhya

• Apr 1st, 2007

 

    hi all !  
i suppose the question was not to use the collections than i hope even linked list comes into the collections package.

Ab mj

• Nov 2nd, 2014

 

Without using collections and arraylist ? Then I guess we have to create our own collection and arraylist classes with methods similar to their implementation which uses array objects. Why again create same class? Better we can use arraylist itself .

chaitanya

• Dec 19th, 2014

 

But if we r using arry instead of Arrylist...Array is immutable we canot add and delete the array elements

kalyankarri

• Dec 26th, 2014

 

Code
ArrayList al=new ArrayList();


al.addelement(10);


al.addelement(20);................


system.out.printn("elements ara",+al);

amol thete

• Jan 27th, 2015

 

use Iterator Design pattern

Yoyo

• Mar 21st, 2015

 

@kalyankarri The questions says without an Arraylist

Amit

• Jun 26th, 2015

 

Code
package collections;


 


import java.util.Arrays;


 


public class MyArray {


 


        private Object[] myStore;


        private int actSize = 0;


        


        public MyArray(){


                myStore = new Object[10];


        }


        


        public Object get(int index){


                if(index < actSize){


                        return myStore[index];


                }else{


                        throw new ArrayIndexOutOfBoundsException();


                }


        }


        public void add(Object obj){


                if(myStore.length - actSize < 5){


                        increaseSize();


                }else{


                        myStore[actSize++] = obj;


                }


                        


        }


        


        private void increaseSize(){


                myStore = Arrays.copyOf(myStore, myStore.length*2);


                System.out.println("new length = "+ myStore.length);


        }


        


        public int size(){


                return actSize;


        }


        


        public static void main(String[] args) {


                // TODO Auto-generated method stub


                


                MyArray my = new MyArray();


                my.add(new Integer(10));


                my.add(new Integer(20));


                my.add(new Integer(30));


                my.add(new Integer(40));


                my.add(new Integer(50));


                


                for(int i=0;i< my.size();i++){


                        System.out.println("Element = "+ my.get(i));


                }


        }


 


}