This is a Java Program to implement Dynamic Array. A dynamic array, growable array, resizable array, dynamic table, mutable array, or array list is a random access, variable-size list data structure that allows elements to be added or removed.
Here is the source code of the Java Program to implement Dynamic Array. The Java program is successfully compiled and run on a Windows system. The program output is also shown below.
/**
** Java Program to implement Dynamic Array
**/
import java.util.Scanner;
import java.util.ArrayList;
/** class DynamicArray */
class DynamicArray
{
private ArrayList<String> al;
/** constructor **/
public DynamicArray()
{
al = new ArrayList<String>();
}
/** function to clear **/
public void clear()
{
al.clear();
}
/** function to get size **/
public int size()
{
return al.size();
}
/** function to insert element **/
public void insert(String key)
{
al.add(key);
}
/** function to get element at index **/
public String get(int index)
{
if (index >= al.size())
return "";
return al.get(index);
}
/** function to remove element at index **/
public void remove(int index)
{
if (index >= al.size())
return ;
al.remove(index);
}
/** function to remove element **/
public void remove(String key)
{
al.remove(key);
}
/** function to display array **/
public void display()
{
System.out.println("\nDynamic Array : "+ al);
System.out.println();
}
}
/** Class DynamicArrayTest **/
public class DynamicArrayTest
{
public static void main(String[] args)
{
Scanner scan = new Scanner(System.in);
System.out.println("Dynamic Array Test\n");
DynamicArray da = new DynamicArray();
char ch;
/* Perform Dynamic Array operations */
do
{
System.out.println("\nDynamic Array\n");
System.out.println("1. insert ");
System.out.println("2. remove by index");
System.out.println("3. remove by val");
System.out.println("4. clear");
System.out.println("5. size");
int choice = scan.nextInt();
switch (choice)
{
case 1 :
System.out.println("Enter value to insert");
da.insert(scan.next() );
break;
case 2 :
System.out.println("Enter index");
da.remove(scan.nextInt() );
break;
case 3 :
System.out.println("Enter value");
da.remove(scan.next() );
break;
case 4 :
System.out.println("\nDynamic Array Cleared");
da.clear();
break;
case 5 :
System.out.println("\nSize = "+ da.size() );
break;
default :
System.out.println("Wrong Entry \n ");
break;
}
da.display();
System.out.println("\nDo you want to continue (Type y or n) \n");
ch = scan.next().charAt(0);
} while (ch == 'Y'|| ch == 'y');
}
}
Dynamic Array Test Dynamic Array 1. insert 2. remove by index 3. remove by val 4. clear 5. size 1 Enter value to insert apple Dynamic Array : [apple] Do you want to continue (Type y or n) y Dynamic Array 1. insert 2. remove by index 3. remove by val 4. clear 5. size 1 Enter value to insert mango Dynamic Array : [apple, mango] Do you want to continue (Type y or n) y Dynamic Array 1. insert 2. remove by index 3. remove by val 4. clear 5. size 1 Enter value to insert banana Dynamic Array : [apple, mango, banana] Do you want to continue (Type y or n) y Dynamic Array 1. insert 2. remove by index 3. remove by val 4. clear 5. size 1 Enter value to insert strawberry Dynamic Array : [apple, mango, banana, strawberry] Do you want to continue (Type y or n) y Dynamic Array 1. insert 2. remove by index 3. remove by val 4. clear 5. size 5 Size = 4 Dynamic Array : [apple, mango, banana, strawberry] Do you want to continue (Type y or n) y Dynamic Array 1. insert 2. remove by index 3. remove by val 4. clear 5. size 2 Enter index 2 Dynamic Array : [apple, mango, strawberry] Do you want to continue (Type y or n) y Dynamic Array 1. insert 2. remove by index 3. remove by val 4. clear 5. size 3 Enter value strawberry Dynamic Array : [apple, mango] Do you want to continue (Type y or n) y Dynamic Array 1. insert 2. remove by index 3. remove by val 4. clear 5. size 5 Size = 2 Dynamic Array : [apple, mango] Do you want to continue (Type y or n) y Dynamic Array 1. insert 2. remove by index 3. remove by val 4. clear 5. size 4 Dynamic Array Cleared Dynamic Array : [] Do you want to continue (Type y or n) n
Related posts:
Java Program to Describe the Representation of Graph using Incidence Matrix
Interface trong Java 8 – Default method và Static method
Java Convenience Factory Methods for Collections
Java Program to Implement Range Tree
Java Program to Implement Slicker Algorithm that avoids Triangulation to Find Area of a Polygon
Tìm hiểu về Web Service
Truyền giá trị và tham chiếu trong java
The Difference Between Collection.stream().forEach() and Collection.forEach()
Guide to Escaping Characters in Java RegExps
Introduction to Using Thymeleaf in Spring
Java List UnsupportedOperationException
LIKE Queries in Spring JPA Repositories
A Guide to Java HashMap
Spring Cloud – Securing Services
The Difference Between map() and flatMap()
Java Streams vs Vavr Streams
Java Program to Find the Nearest Neighbor Using K-D Tree Search
Hướng dẫn sử dụng biểu thức chính quy (Regular Expression) trong Java
Java Program to Use the Bellman-Ford Algorithm to Find the Shortest Path
Java Program to Implement Weight Balanced Tree
Lấy ngày giờ hiện tại trong Java
Hướng dẫn Java Design Pattern – Visitor
Java Program to Decode a Message Encoded Using Playfair Cipher
Java Program to Check whether Graph is Biconnected
Introduction to Spring MVC HandlerInterceptor
Calling Stored Procedures from Spring Data JPA Repositories
Java Program to Implement Leftist Heap
Java Program to Check the Connectivity of Graph Using DFS
Hướng dẫn Java Design Pattern – Object Pool
Spring Boot - Thymeleaf
JWT – Token-based Authentication trong Jersey 2.x
Jackson Unmarshalling JSON with Unknown Properties