Skip to main content

How to Create Nested ArrayList in Java | 2D ArrayList - BlogonCode

Multi-Dimensional ArrayList in Java | Creating and Store Elements in Nested ArrayList

Multi-Dimensional ArrayList in Java | Creating and Store Elements in Nested ArrayList

In Java, ArrayList is Class of Java Collections framework that stores elements with resizable arrays. ArrayList is also called Dynamic Arrays.

Often times, We need to store data in dynamic array rather than static array. So in this tutorial we will seen how we can create, store and print nested or two dimensional arraylist elements.

We will seen two approach for storing nested elements in ArrayList.

  1. Creating Nested ArrayList with Static Elements
  2. Creating Nested ArrayList with Dynamic Elements using Scanner Class

Learn more about ArrayList class :

Example 1 : Nested ArrayList with Static Elements

import java.util.ArrayList;
import java.util.List;

public class NestedArrayList {

    public static void main(String[] args) {
       
        List<ArrayList<Integer>> outerList = new ArrayList<>();

        ArrayList<Integer> al1 = new ArrayList<Integer>();
        ArrayList<Integer> al2 = new ArrayList<Integer>();

        al1.add(1);
        al1.add(2);
        al1.add(3);
       
        al2.add(4);
        al2.add(5);
        al2.add(6);
       
        outerList.add(al1);
        outerList.add(al2);
       
        System.out.println(outerList);

    }
}

Output :

[[1, 2, 3], [4, 5, 6]]

Now lets see how to store user defined elements in nested arraylist

Example 2 : Nested ArrayList with Dynamic (User defined) Elements

import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class NestedArrayList {

    public static void main(String[] args) {
       
        Scanner sc = new Scanner(System.in);
        System.out.println("Enter Size of ArrayList");
        int size = sc.nextInt();
        List<List<Integer>> outerList = new ArrayList<List<Integer>>();
        List<Integer> innerList = null;
        System.out.println("Insert Elements");
       
        for (int i = 0; i < size; i++) {
            innerList = new ArrayList<Integer>();
            for (int j = 0; j < size; j++) {
                innerList.add(sc.nextInt());
            }
            outerList.add(innerList);
        }
       
        System.out.println(outerList);

    }
}

Output :

Enter Size of ArrayList
2
Insert Elements
1 2 3 4
[[1, 2], [3, 4]]
________________________

Enter Size of ArrayList
4
Insert Elements
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]]


RECOMMENDED ARTICLES :

 

Comments

Popular posts from this blog

Queen's Attack II HackerRank Solution in Java with Explanation

Queen's Attack II Problem's Solution in Java (Chessboard Problem)   Problem Description : You will be given a square chess board with one queen and a number of obstacles placed on it. Determine how many squares the queen can attack.  A queen is standing on an n * n chessboard. The chess board's rows are numbered from 1 to n, going from bottom to top. Its columns are numbered from 1 to n, going from left to right. Each square is referenced by a tuple, (r, c), describing the row r and column c, where the square is located. The queen is standing at position (r_q, c_q). In a single move, queen can attack any square in any of the eight directions The queen can move: Horizontally (left, right) Vertically (up, down) Diagonally (four directions: up-left, up-right, down-left, down-right) The queen can move any number of squares in any of these directions, but it cannot move through obstacles. Input Format : n : The size of the chessboard ( n x n ). k : The number of obstacles...

Simple Text Editor HackerRank Solution in Java with Explanation

Simple Text Editor HackerRank Solution in Java with Explanation Problem Description : Implement a simple text editor. The editor initially contains an empty string S. Perform Q operations of the following 4 types: append (W) - Append string W to the end of S. delete (k) - Delete the last K characters of S. print (k) - Print the kth character of S. undo () - Undo the last (not previously undone) operation of type 1 or 2, reverting S to the state it was in prior to that operation. Example : Input : S = "abcde" Operations = ["1 fg", "3 6", "2 5", "4", "3 7", "4", "3 4"] index   S          ops[index]    explanation -----   ------     ----------    ----------- 0       abcde      1 fg          append fg 1       abcdefg    3 6        ...