Minimum Cost Homecoming of a Robot in a Grid LeetCode solution in Python

1
class Solution:
2
    def minCost(
3
        self,
4
        startPos: List[int],
5
        homePos: List[int],
6
        rowCosts: List[int],
7
        colCosts: List[int],
8
    ) -> int:
9
        def getRange(left, right, array):
10
            if left > right:
11
                right, left = left, right
12
            return sum((array[i] for i in range(left, right + 1)))
13

14
        totalRowCost = getRange(startPos[0], homePos[0], rowCosts)
15
        totalColCost = getRange(startPos[1], homePos[1], colCosts)
16

17
        # Don't pay for the position you start out on
18
        return (
19
            totalRowCost + totalColCost - rowCosts[startPos[0]] - colCosts[startPos[1]]
20
        )