g0101_0200.s0198_house_robber.Solution.scala Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-all Show documentation

104 LeetCode algorithm problem solutions

The newest version!

package g0101_0200.s0198_house_robber

// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming
// #Algorithm_I_Day_12_Dynamic_Programming #Dynamic_Programming_I_Day_3
// #Level_2_Day_12_Dynamic_Programming #Udemy_Dynamic_Programming #Big_O_Time_O(n)_Space_O(n)
// #2023_11_05_Time_426_ms_(98.04%)_Space_54.8_MB_(49.02%)

object Solution {
    def rob(nums: Array[Int]): Int = {
        val n = nums.length
        if (n == 0) return 0
        if (n == 1) return nums(0)
        if (n == 2) return Math.max(nums(0), nums(1))

        val profit = new Array[Int](n)
        profit(0) = nums(0)
        profit(1) = Math.max(nums(0), nums(1))

        for (i <- 2 until n) {
            profit(i) = Math.max(profit(i - 1), nums(i) + profit(i - 2))
        }

        profit(n - 1)
    }
}