Advertisement
Aykhann

Untitled

Jan 16th, 2019
101
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Java 1.90 KB | None | 0 0
  1. package com.tester;
  2.  
  3. import java.util.Random;
  4. import java.util.Scanner;
  5.  
  6. public class ArrayMatrixRemoval {
  7.     public static void main(String[] args) {
  8.         int[][] myarr = new int[3][3];
  9.         Random rand = new Random();
  10.         for(int i=0;i<myarr.length;i++)
  11.         {
  12.             for(int j=0;j<myarr[i].length;j++)
  13.             {
  14.                 myarr[i][j] = rand.nextInt(50);
  15.                 System.out.printf("%3d ",myarr[i][j]);
  16.             }
  17.             System.out.println();
  18.         }
  19.         Scanner scan = new Scanner(System.in);
  20.         System.out.println("Enter the number of row to delete(from 0 to "+(myarr[0].length-1) + " :");
  21.         int k = scan.nextInt();
  22.         //Does not alter the size of the initial array
  23.         //Just shifts all rows starting from k to left
  24. //        for(int i=0;i<myarr.length;i++)
  25. //        {
  26. //            for(int j=k;j<myarr[i].length-1;j++)
  27. //            {
  28. //                myarr[i][j] = myarr[i][j+1];
  29. //            }
  30. //        }
  31.         //On contrary alters the dimenosions of matrix by creating new one
  32.         myarr = remove(k,myarr);
  33.         for(int i=0;i<myarr.length;i++)
  34.         {
  35.             //If first method was used myarr[i].length should be changed to myarr[i].length-1
  36.             //Because last row is deleted one
  37.             for(int j=0;j<myarr[i].length;j++)
  38.             {
  39.                 System.out.printf("%3d ",myarr[i][j]);
  40.             }
  41.             System.out.println();
  42.         }
  43.     }//End of main
  44.     public static int[][] remove(int k,int[][] myarr)
  45.     {
  46.         int[][] res = new int[myarr.length][myarr[0].length - 1];
  47.         for(int i=0;i<myarr.length;i++)
  48.         {
  49.             for(int j=0;j<myarr[i].length;j++)
  50.             {
  51.              
  52.                 if(j < k)res[i][j] = myarr[i][j];
  53.                 else if(j > k)res[i][j-1] = myarr[i][j];
  54.             }
  55.         }
  56.         return res;
  57.     }
  58. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement