i need to do it in a recursive way.
the function i need to write is get the size of the matrix and 2d array called tiles.
tiles[][] contains for example {{1, 1}, {1, 1}, {1, 1}, {1, 1}}, and the size of the matrix 2,2.
now i need to take those details and check if the matrix contains the list of tiles , for this example is true because {1,1} is a one place in the matrix is like 1X1 , before the X is Height and after is Width. ( you can see in the image below).
the function is :
public static int[][] insertIntoKnapsack(int n, int m, int[][] tiles) {
int[][] ans = new int[n][m];
int H,W;
for(int ind=0;ind<tiles.length;ind++)
{
H = tiles[ind][0];
W = tiles[ind][1];
now i stuck i dont know what do to check.
any ideas?
thanks.
This post has been edited by Atli: 08 December 2012 - 12:19 PM
Reason for edit:: Use [code] tags when posting code.

New Topic/Question
Reply



MultiQuote


|