House Robber Tamil (தமிழ்): Leetcode 75

[@indiccoder]

Python Solution: class Solution: def rob(self, nums: List[int]) -> int: if len(nums)==1: return nums[0] nums[1] = max(nums[0],nums[1]) for i in range(2, len(nums)): nums[i] = max(nums[i-1],nums[i-2]+nums[i]) return nums[-1]

[@indiccoder]

Java Solution: class Solution { public int rob(int[] nums) { if(nums.length==1) { return nums[0]; } nums[1] = Math.max(nums[1], nums[0]); for(int i=2; i