Fixed a massive bugs, please redownload
This commit is contained in:
parent
cb435fae59
commit
6849efa946
5 changed files with 12 additions and 3 deletions
|
@ -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 (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
|
||||
for(int i = 0;i < n;i++)for(int j = 0;j<d.length/n;j++)splittedArray[i][j] = d[j*n+i]; //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*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
|
||||
}
|
||||
|
||||
|
|
|
@ -2,8 +2,8 @@
|
|||
public class ArrayUtilityTest {
|
||||
public static void main(String[] args) {
|
||||
// testMerge();
|
||||
// testSplit();
|
||||
myTestSplit();
|
||||
testSplit();
|
||||
// myTestSplit();
|
||||
myTestMerge();
|
||||
}
|
||||
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue