2D Array ProgramesUpdate
2D Array ProgramesUpdate
1.Create a 2Darray?
package Array2D;
import java.util.Scanner;
System.out.println("Enter a row");
int row=scn.nextInt();
System.out.println("Enter a rcol");
int col=scn.nextInt();
for(int i=0;i<a.length;i++)
for(int j=0;j<a[i].length;j++)
a[i][j] = scn.nextInt();
for(int i=0;i<a.length;i++)
for(int j=0;j<a[i].length;j++)
System.out.print(a[i][j]+" ");
}
System.out.println();
O/P
Enter a row
Enter a rcol
1 2 3
4 5 6
7 8 9
import java.util.Scanner;
System.out.println("Enter a row");
int row=scn.nextInt();
System.out.println("Enter a rcol");
int col=scn.nextInt();
for(int i=0;i<a.length;i++)
for(int j=0;j<a[i].length;j++)
a[i][j] =scn.next().charAt(0);
for(int i=0;i<a.length;i++)
for(int j=0;j<a[i].length;j++)
System.out.print(a[i][j]+" ");
System.out.println();
}
O/P
Enter a row
Enter a rcol
a s d
f g h
h j k
import java.util.Scanner;
System.out.println("Enter a row");
int row=scn.nextInt();
System.out.println("Enter a rcol");
int col=scn.nextInt();
for(int i=0;i<a.length;i++)
for(int j=0;j<a[i].length;j++)
a[i][j] = scn.nextInt();
for(int i=0;i<a.length;i++)
for(int j=0;j<a[i].length;j++)
System.out.print(a[i][j]+" ");
System.out.println();
}
O/P
Enter a row
Enter a rcol
10
20
30
40
50
60
70
80
90
int bg;
for(int i=0;i<a1.length;i++)
bg=a1[i][0];
for(int j=0;j<a1[i].length;j++)
if(bg<a1[i][j]) bg=a1[i][j];
System.out.print(bg+" ");
System.out.println();
O/P
30 60 90
5.Write a Program Biggest Element of Each col?
package Array2d27;
int bg;
for(int i=0;i<a1.length;i++)
bg=a1[i][0];
for(int j=0;j<a1[i].length;j++)
if(bg<a1[j][i]) bg=a1[j][i];
System.out.print(bg+" ");
System.out.println();
O/P
70 80 90
package Array2d27;
boolean flag=true;
for(int i=0;i<a1.length;i++)
for(int j=0;j<a1[i].length;j++)
{
if(a1[i][j]!=a2[i][j])
flag=false;
break;
if(flag)
else
O/P
int[][] a= {{1,2,3},{4,5,6},{7,8,9}};
int even = 0;
int odd = 0;
for(int i=0;i<a.length;i++)
for(int j=0;j<a[i].length;j++)
if(a[i][j]%2==0) even++;
else odd++;
O/P
4 even numbers
5 odd numbers
8. Take a matrix input and check if it is identity matrix?
package Array2d27;
import java.util.Scanner;
int arrd[][] = { { 1, 0, 0 }, { 0, 1, 0 }, { 0, 0, 1 } };
{
for (int j = 0; j < arrd[i].length; j++)
if(i==j)
if(arrd[i][j]==1)
{}
else {
flag=false;
break;
else if(arrd[i][j]!=0)
flag=false;
break;
if (flag)
System.out.println("Identity Matrix");
else
}
O/P
Identity Matrix
package Array2d27;
int[][] a= {{1,2,3},{4,5,6},{7,8,9}};
for(int i=0;i<a.length;i++)
for(int j=0;j<a[i].length;j++)
if(i<j)
System.out.print("0"+" ");
else
System.out.print(a[i][j]+" ");
System.out.println();
}
O/P
1 0 0
4 5 0
7 8 9
int[][] a= {{1,2,3},{4,5,6},{7,8,9}};
for(int i=0;i<a.length;i++)
for(int j=0;j<a[i].length;j++)
if(i>j)
System.out.print("0"+" ");
else
System.out.print(a[i][j]+" ");
System.out.println();
}
}
O/P
123
056
009
for(int i=0;i<sum.length;i++)
for(int j=0;j<sum.length;j++)
sum[i][j]=a1[i][j]+a2[i][j];
System.out.print(sum[i][j]+" ");
System.out.println();
O/P
20 40 60
80 100 120
import java.util.Scanner;
int row=sc.nextInt();
int col=sc.nextInt();
for(int i=0;i<row;i++)
for(int j=0;j<col;j++)
arr[i][j]=sc.nextInt();
for(int i=0;i<row;i++)
{
for(int j=0;j<col;j++)
System.out.print(arr[i][j]+" ");
System.out.println();
int row1=sc.nextInt();
int col1=sc.nextInt();
for(int i=0;i<row1;i++)
for(int j=0;j<col1;j++)
arr1[i][j]=sc.nextInt();
for(int i=0;i<row1;i++)
for(int j=0;j<col1;j++)
System.out.print(arr1[i][j]+" ");
System.out.println();
}
for(int k=0;k<col;k++)
System.out.println();
for(int i=0;i<row;i++)
for(int j=0;j<col;j++)
System.out.print(multi[i][j]+" ");
System.out.println();
Another way.
package Programms;
import java.util.Arrays;
System.out.println(Arrays.deepToString(c));
}
}
O/P
Enter The row size..
12
34
56
67
17 20
39 46
int bg = a1[0][0];
for(int i=0;i<a1.length;i++)
for(int j=0;j<a1[i].length;j++)
{
if(bg<a1[i][j]) bg=a1[i][j];
System.out.print(bg+" ");
O/P
150
int[][] a= {{4,6,0},{0,0,2},{3,0,0}};
int count=0;
int num=0;
for(int i=0;i<a.length;i++)
for(int j=0;j<a[i].length;j++)
if(a[i][j]==0) count++;
if(a[i][j]!=0) num++;
}
if(count>num)
System.out.println("Sparse");
else
System.out.println("Not Sparse");
O/P
Sparse
for(int i=0;i<sum.length;i++)
for(int j=0;j<sum.length;j++)
{
sum[i][j]=a1[i][j]-a2[i][j];
System.out.print(sum[i][j]+" ");
System.out.println();
O/P
9 18 27
36 45 54
63 72 81
for(int i=0;i<a1.length;i++)
for(int j=0;j<a1[i].length;j++)
System.out.print(a1[i][j]+" ");
}
System.out.println();
for(int i=0;i<a1.length;i++)
int sum=0;
for(int j=0;j<a1[i].length;j++)
sum+=a1[j][i];
System.out.print(sum+" ");
O/P
10 20 30
40 50 60
70 80 90
for(int i=0;i<a1.length;i++)
for(int j=0;j<a1[i].length;j++)
System.out.print(a1[i][j]+" ");
System.out.println();
for(int i=0;i<a1.length;i++)
int sum=0;
for(int j=0;j<a1[i].length;j++)
sum+=a1[i][j];
System.out.print(sum+" ");
O/P
10 20 30 = 60
40 50 60 = 150
70 80 90 = 240
package Array2d27;
int[][] a= {{1,2,3},{4,5,6},{7,8,9}};
for(int i=0;i<a.length;i++)
for(int j=0;j<a.length;j++)
System.out.print(a[j][i]+" ");
System.out.println();
O/P
1 4 7
2 5 8
3 6 9
19. WAJP Spiral Maitrix?
package Programms;
for(int [] t:a) {
for(int n:t) {
System.out.print(n+"\t");
}
System.out.println();
System.out.println();
}
}
case 'd':r++;
a[r][c]=i;
if(r==size-1||a[r+1][c]!=0) mov='l';
break;
case 'l':c--;
a[r][c]=i;
if(c==0||a[r][c-1]!=0) mov='u';
break;
case 'u':r--;
a[r][c]=i;
if(r==0||a[r-1][c]!=0) mov = 'r';
break;
}
}
return a;
}
}
O/p
1 2 3 4 5
16 17 18 19 6
15 24 25 20 7
14 23 22 21 8
13 12 11 10 9
import java.util.Arrays;
int[][] a = pascalTriangle(5);
int spaces = 4;
for(int[] t: a)
{
for(int i=1;i<=spaces;i++) System.out.print("
");
for(int n:t)
{
System.out.print(n+" ");
}
System.out.println();
spaces--;
}
for(int j=0;j<a[i].length;j++)
{
if(j==0 || i==j)
{
a[i][j]=1;
}
else
{
a[i][j]=a[i-1][j-1]+a[i-1][j];
}
}
}
return a;
}
}
O/p
1
1 1
1 2 1
1 3 3 1
1 4 6 4 1
O/p
25
package Programms;
import java.util.Arrays;
public class ArraysDecending {
public static void main(String[] args) {
int[][] a= {{1,2,3},{4,5,6},{7,8,9}};
for(int row=0;row<a.length;row++)
{
sort(a[row]);
}
}
private static void sort(int[] a) {
for(int i=0;i<a.length;i++)
{
for(int j=i+1;j<a.length;j++)
{
if(a[i]<a[j])
{
int temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}
}
System.out.println(Arrays.toString(a));
}
O/p
[3, 2, 1]
[6, 5, 4]
[9, 8, 7]