Minimum Cost Path Java

PROGRAM TO FIND MINIMUM COST PATH



import java.util.*;
class MAIN{
 
static int row = 3;
static int col = 3;
 
static int minCost(int cost[][])
{
  // for 1st column
  for (int i = 1; i < row; i++)
  {
    cost[i][0] += cost[i - 1][0];
  }
 
  // for 1st row
  for (int j = 1; j < col; j++)
  {
    cost[0][j] += cost[0][j - 1];
  }
 
  // for rest of the 2d matrix
  for (int i = 1; i < row; i++)
  {
    for (int j = 1; j < col; j++)
    {
      cost[i][j] += Math.min(cost[i - 1][j - 1],
                    Math.min(cost[i - 1][j],
                             cost[i][j - 1]));
    }
  }
 
  // Returning the value in
  // last cell
  return cost[row - 1][col - 1];
}
   
// Driver code 
public static void  main(String[] args)
{    
  int cost[][] = {{1, 2, 3},
                  {4, 8, 2},
                  {1, 5, 3} };
  System.out.print(minCost(cost) + "\n");
}
}

OUTPUT:
8

Comments

Post a Comment

Popular posts from this blog

Solve the Sudoku Python

PROGRAM TO SOLVE SUDOKU # A Utility Function to print the Grid def print_grid(arr):      for i in range ( 9 ):          for j in range ( 9 ):              print arr[i][j],          print ( 'n' )              # Function to Find the entry in # the Grid that is still  not used # Searches the grid to find an # entry that is still unassigned. If # found, the reference parameters # row, col will be set the location # that is unassigned, and true is # returned. If no unassigned entries # remains, false is returned. # 'l' is a list  variable that has # been passed from the solve_sudoku function # to keep track of incrementation # of Rows and Columns def find_empty_location(arr, l):      for row in range ( 9 ):       ...
Read more

Find Duplicates Java

PROGRAM TO FIND REPEATING NUMBERS IN AN ARRAY class MAIN {           public static void main(String args[]) {          int numRay[] = { 0 , 4 , 3 , 2 , 7 , 8 , 2 , 3 , 1 };               for ( int i = 0 ; i < numRay.length; i++) {              numRay[numRay[i] %  numRay.length] = numRay[numRay[i] %  numRay.length] + numRay.length;          }          System.out.println( "The repeating elements are : " );          for ( int i = 0 ; i < numRay.length; i++) {              if (numRay[i] >= numRay.length* 2 ) {                ...
Read more

Solve the Sudoku Java

PROGRAM TO SOLVE SUDOKU class GFG {      public static boolean isSafe( int [][] board,                                   int row, int col,                                   int num)      {          // Row has the unique (row-clash)          for ( int d = 0 ; d < board.length; d++)          {                             // Check if the number we are trying to   ...
Read more