Minimum Path Sum in scala

Sumit Rawal answered on September 2, 2023 Popularity 1/10 Helpfulness 1/10

answer Minimum Path Sum in scala

Minimum Path Sum in scala

Comment

object MinimumPathSum {
  def minPathSum(grid: Array[Array[Int]]): Int = {
    if (grid.isEmpty || grid(0).isEmpty) return 0

    val rows = grid.length
    val cols = grid(0).length

    // Create a DP array to store the minimum path sum for each cell.
    val dp = Array.ofDim[Int](rows, cols)

    // Initialize the first cell with its value.
    dp(0)(0) = grid(0)(0)

    // Initialize the first row and first column.
    for (i <- 1 until rows) {
      dp(i)(0) = dp(i - 1)(0) + grid(i)(0)
    }
    for (j <- 1 until cols) {
      dp(0)(j) = dp(0)(j - 1) + grid(0)(j)
    }

    // Fill in the DP array by choosing the minimum path sum from the top or left cell.
    for (i <- 1 until rows) {
      for (j <- 1 until cols) {
        dp(i)(j) = grid(i)(j) + Math.min(dp(i - 1)(j), dp(i)(j - 1))
      }
    }

    // The value in the bottom-right cell contains the minimum path sum.
    dp(rows - 1)(cols - 1)
  }

  def main(args: Array[String]): Unit = {
    val grid = Array(
      Array(1, 3, 1),
      Array(1, 5, 1),
      Array(4, 2, 1)
    )
    val minSum = minPathSum(grid)
    println(s"Minimum path sum: $minSum")
  }
}

Popularity 1/10 Helpfulness 1/10 Language scala

Source: chat.openai.com

Tags: minimum path scala sum

Link to this answer
Share Copy Link

Contributed on Sep 02 2023

Sumit Rawal

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

Minimum Path Sum in scala

Contents

More Related Answers

Minimum Path Sum in scala

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.