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:
Allow user:password in URL
Java Program to Generate a Random UnDirected Graph for a Given Number of Edges
Using the Map.Entry Java Class
Remove HTML tags from a file to extract only the TEXT
Hướng dẫn sử dụng biểu thức chính quy (Regular Expression) trong Java
Rest Web service: Filter và Interceptor với Jersey 2.x (P1)
Reversing a Linked List in Java
Java Program to Find k Numbers Closest to Median of S, Where S is a Set of n Numbers
Spring Boot - Database Handling
Java Program to Implement Interpolation Search Algorithm
Java Program to Implement Queue
Spring Boot Integration Testing with Embedded MongoDB
Java Program to Implement the Hill Cypher
Java Program to Generate Randomized Sequence of Given Range of Numbers
A Guide to EnumMap
Java Program to Implement Leftist Heap
Java Program to do a Breadth First Search/Traversal on a graph non-recursively
Java Program to Implement Interval Tree
Constructor Dependency Injection in Spring
A Custom Data Binder in Spring MVC
Java Program to Check Whether a Directed Graph Contains a Eulerian Path
Giới thiệu HATEOAS
Exploring the New Spring Cloud Gateway
Tạo số và chuỗi ngẫu nhiên trong Java
Java Collections Interview Questions
Spring Security Logout
Java Switch Statement
Java Program to Implement Branch and Bound Method to Perform a Combinatorial Search
Spring Boot - Admin Client
Why String is Immutable in Java?
Java Program to Describe the Representation of Graph using Adjacency Matrix
Java Program to Implement Best-First Search