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

Plus Minus HackerRank Solution in Java | Programming Blog

Java Solution for HackerRank Plus Minus Problem Given an array of integers, calculate the ratios of its elements that are positive , negative , and zero . Print the decimal value of each fraction on a new line with 6 places after the decimal. Example 1 : array = [1, 1, 0, -1, -1] There are N = 5 elements, two positive, two negative and one zero. Their ratios are 2/5 = 0.400000, 2/5 = 0.400000 and 1/5 = 0.200000. Results are printed as:  0.400000 0.400000 0.200000 proportion of positive values proportion of negative values proportion of zeros Example 2 : array = [-4, 3, -9, 0, 4, 1]  There are 3 positive numbers, 2 negative numbers, and 1 zero in array. Following is answer : 3/6 = 0.500000 2/6 = 0.333333 1/6 = 0.166667 Lets see solution Solution 1 import java.io.*; import java.math.*; import java.security.*; import java.text.*; import java.util.*; import java.util.concurrent.*; import java.util.function.*; import java.util.regex.*; import java.util.stream.*; import static java.util.st

Flipping the Matrix HackerRank Solution in Java with Explanation

Java Solution for Flipping the Matrix | Find Highest Sum of Upper-Left Quadrant of Matrix Problem Description : Sean invented a game involving a 2n * 2n matrix where each cell of the matrix contains an integer. He can reverse any of its rows or columns any number of times. The goal of the game is to maximize the sum of the elements in the n *n submatrix located in the upper-left quadrant of the matrix. Given the initial configurations for q matrices, help Sean reverse the rows and columns of each matrix in the best possible way so that the sum of the elements in the matrix's upper-left quadrant is maximal.  Input : matrix = [[1, 2], [3, 4]] Output : 4 Input : matrix = [[112, 42, 83, 119], [56, 125, 56, 49], [15, 78, 101, 43], [62, 98, 114, 108]] Output : 119 + 114 + 56 + 125 = 414 Full Problem Description : Flipping the Matrix Problem Description   Here we can find solution using following pattern, So simply we have to find Max of same number of box like (1,1,1,1). And last