Java Arrays - The Coding Shala

Home >> Learn Java >> Java Arrays

Arrays

An array is a collection of the same data type variables. We can access and store the variables in an array by its index. In Java, arrays may have one or more dimensions like a 1-D array, 2-D arrays or multi-Dimensional arrays.
Java Arrays - The Coding Shala

Java One-Dimensional Arrays(1-D Array)


The basic syntax to declare Java 1-D array is as follows - 

type array_name[];

or

type[] array_name;

Here, type declares the data type of the array means which type of data is going to store inside the array. For example - 

int arr[];

Here, an array named arr is created having type int. We can store integer values inside arr.

Here, array_name is set to null which means an array with no value. A new operator is used to allocate memory to the array so the basic syntax is as follows - 

type array_name[]  = new type[size];

or

type[] array_name = new type[size];

Here, the size specified the numbers of elements in the array. We can access a specified element in the array by specifying its index within the square bracket.

In Java, all array indexes start at zero. Arrays can be initialized when they are declared. To initialize the array we have to assign a list of comma-separated data or expressions surrounded by curly braces. There is no need to use new in this case.

The following Java program demonstrates the 1-D array - 
class ArrExample {
    public static void main(String[] args){
        int arr[] = new int[5]; //int array arr with size 5
        arr[0] = 1;
        arr[1] = 2;
        arr[2] = 3;
        arr[3] = 4;
        arr[4] = 5;
        System.out.println("Array arr contains at index 1 is: "+ arr[1]);
        
        int arr2[] = { 1, 2, 3, 4, 5}; //same as arr
        System.out.println("Array arr2 contains at index 1 is: " + arr2[1]);
    }
}




Output>>>>>>>>>>>>>>>
Array arr contains at index 1 is: 2
Array arr2 contains at index 1 is: 2

Java Multidimensional Arrays

In Java, multidimensional arrays are arrays of arrays. The following syntax is used to declare a 2-D array - 

type array_name[] [] = new type[size] [size];

Similar we can also declare 3-D array - 

type array_name[] [] [] = new type[size] [size] [size];

The following example explains Java 2-D array - 

class TwoDArray{
    public static void main(String[] args){
        int twoD[][] = new int[4][5]; //ceate 2-D array of 4*5
        int k=1;
        
        for(int i=0;i<4;i++){
            for(int j=0;j<5;j++){
                twoD[i][j] = k;
                k++;
            }
        }
        
        for(int i=0;i<4;i++){
            for(int j=0;j<5;j++){
                System.out.print(twoD[i][j] + " ");
            }
            System.out.println();
        }
    }
}




Output>>>>>>>>>>>>>>>
1 2 3 4 5 
6 7 8 9 10 
11 12 13 14 15 
16 17 18 19 20

When we allocate memory for the multi-dimensional array, we need to specify the memory for the first(leftmost) dimension. For the remaining dimensions, we can allocate separately. For example - 

int twoD[] [] = new int[4] [];
twoD[0] = new int[5];
twoD[1] = new int[5];
twoD[2] = new int[5];
twoD[3] = new int[5];



Other Posts You May Like
Please leave a comment below if you like this post or found some error, it will help me to improve my content.
By

Comments

Post a Comment

Popular Posts from this Blog

Shell Script to Create a Simple Calculator - The Coding Shala

Home >> Scripting >> simple calculator Shell Script to Create a Simple Calculator Write a shell script to create a simple calculator using a switch-case statement? Code:  #! / bin / bash echo "simple calculator" sum = 0 i = "y" echo "enter first number" read n1 echo "enter second number" read n2 while [ $ i = "y" ] do echo "1.Addition" echo "2.Subtraction" echo "3.Multiplication" echo "4.Division" echo "Enter choice" read ch case $ch in 1 ) sum =$(echo " $n1 + $n2" | bc - l) echo "Addition is =" $ sum ;; 2 ) sum =$(echo "$n1 - $n2" | bc - l) echo "Sub is =" $ sum ;; 3 ) sum =$(echo "$n1 * $n2" | bc - l) echo "Mul is =" $ sum ;; 4 ) sum =$(echo "$n1 / $n2" | bc - l) echo "div is =" $ sum ;; * )echo "invalid choice" esac echo "Do y...
Read more

N-th Tribonacci Number Solution - The Coding Shala

Home >> Programming >> N-th Tribonacci Number  Hey there, welcome back to another post. In this post, we will learn how to solve the N-th Tribonacci Number problem and will implement its solution in Java. N-th Tribonacci Number Problem Statement The Tribonacci sequence Tn is defined as follows: T0 = 0, T1 = 1, T2 = 1, and Tn+3 = Tn + Tn+1 + Tn+2 for n >= 0. Given n, return the value of Tn.  Example 1:  Input: n = 4 Output: 4 Explanation: T_3 = 0 + 1 + 1 = 2 T_4 = 1 + 1 + 2 = 4 N-th Tribonacci Number Java Solution using Bottom-Up DP This problem is similar to the Fibonacci series. We can solve it using the Bottom-Up approach of dynamic programming. Time Complexity: O(n) Space Complexity: O(n) The space complexity can be reduced to O(1) by using variables to store the previous three values instead of using an array. Java Program:  class Solution { public int tribonacci( int n) { if (n == 0) return 0; ...
Read more

Java Program to Convert Binary to Decimal - The Coding Shala

Home >> Java Programs >> Convert Binary to Decimal  Hey there, welcome back to another post. In this post, we will learn how to convert Binary to Decimal in Java. Java Program to Convert Binary to Decimal You have given a binary number, convert it to a decimal number. Example:  Input: 101 Output: 5 Input: 111 Output: 7 Binary to Decimal Conversion in Java Approach We will the below formula to convert binary to decimal: decimal number = (2^0) * (rightmost digit) + (2^1) * (second rightmost digit) + ...  for example:  binary number = 110 decimal number = 2^0 * 0 + 2^1 * 1 + 2^2 * 1 = 1 * 0 + 2 * 1 + 4 * 1 = 0 + 2 + 4 = 6 Java Program:  import java.util.Scanner; /** * https://www.thecodingshala.com/ */ public class Main { public static void printDecimal( int num) { int decimal = 0; int twos = 1; // 2^0 = 1 initial value while (num > 0) { ...
Read more

LeetCode - Shuffle the Array Solution - The Coding Shala

Home >> LeetCode >> Shuffle the Array  In this post, we will learn how to solve LeetCode's Shuffle the Array problem and will implement its solution in Java. Shuffle the Array Given the array nums consisting of 2n elements in the form [x1,x2,...,xn,y1,y2,...,yn]. Return the array in the form [x1,y1,x2,y2,...,xn,yn]. Example 1: Input: nums = [2,5,1,3,4,7], n = 3 Output: [2,3,5,4,1,7]  Explanation: Since x1=2, x2=5, x3=1, y1=3, y2=4, y3=7 then the answer is [2,3,5,4,1,7]. Example 2: Input: nums = [1,2,3,4,4,3,2,1], n = 4 Output: [1,4,2,3,3,2,4,1] Practice this problem on LeetCode: Click Here. Shuffle the Array Java Solution Approach 1: Using a new Array. Space complexity: O(n). Java Program:  class Solution { public int [] shuffle ( int [] nums , int n ) { int [] ans = new int [ 2 * n ]; int j = 0 ; for ( int i = 0 ; i < 2 * n ; i = i + 2 ){ ans [ i ] = nums [ j ]; ans...
Read more

Java Program to Find GCD or HCF of Two Numbers - The Coding Shala

Home >> Java Programs >> Find GCD of Two Numbers  Hey there, welcome back to another post. In this post, we will learn how to find GCD or HCF of Two Numbers in Java. Java Program to Find GCD or HCF of Two Numbers The GCD (Greatest Common Divisor) or HCF (Highest Common Factor) of two numbers is the largest number that divides both of them. For example:  Number1: 6 (2 * 3) Number2: 9 (3 * 3) GCD or HCF of 6 and 9 is: 3 Find GCD of Two Numbers in Java using for Loop As we already know, GCD is the largest number that divides both numbers. We can start a for loop from 1 (because 1 divides all the numbers) to both numbers and if it divides both numbers then update GCD. Java Program:  import java.util.Scanner; /** * https://www.thecodingshala.com/ */ public class Main { public static void findGCD( int num1, int num2) { int gcd = 1; if (num1 == 0) { gcd = num2; } if (num2 == 0) { ...
Read more