siwat
/
ISE-ComProg-After-Midterm
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Bug Fixes

This commit is contained in:
Siwat Sirichai 2020-10-30 00:59:17 +07:00
parent 6849efa946
commit 948efc0606
2 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

BIN
Week9/Assignment9/bin/ArrayUtility.class
View File

Binary file not shown.

2
Week9/Assignment9/src/ArrayUtility.java
View File

@ -34,7 +34,7 @@ public class ArrayUtility {
if(n<=0) return new int[0][0]; //Return to prevent ArithmeticException: / by zero and negative array index if(n<=0) return new int[0][0]; //Return to prevent ArithmeticException: / by zero and negative array index
if (d.length%n!=0)return new int[0][0]; //Return, empty array, array can't be split into n equal parts if (d.length%n!=0)return new int[0][0]; //Return, empty array, array can't be split into n equal parts
int[][] splittedArray = new int[n][d.length/n]; //Create the splitted_array array and initialize it int[][] splittedArray = new int[n][d.length/n]; //Create the splitted_array array and initialize it
for(int i = 0;i < n;i++)for(int j = 0;j<d.length/n;j++)splittedArray[i][j] = d[i*n+j]; //Loop for n Row and d.length/n column, the position of 2d array is row * ROW_SIZE + column for(int i = 0;i < n;i++)for(int j = 0;j<d.length/n;j++)splittedArray[i][j] = d[i*(d.length/n)+j];//Loop for n Row and d.length/n column, the position of 2d array is row * ROW_SIZE + column
return splittedArray; //send the reference back return splittedArray; //send the reference back
} }