Squirrel Simulation Python Solution with Tests

lcpy gen -n 573   # by problem number
lcpy gen -s squirrel_simulation   # by problem name

Input: height = 5, width = 7, tree = [2,2], squirrel = [4,4], nuts = [[3,0], [2,5]]
Output: 12

Input: height = 1, width = 3, tree = [0,1], squirrel = [0,0], nuts = [[0,2]]
Output: 3

class Solution:
    # Time: O(n)
    # Space: O(1)
    def min_distance(
        self, height: int, width: int, tree: list[int], squirrel: list[int], nuts: list[list[int]]
    ) -> int:
        tr, tc = tree
        sr, sc = squirrel
        to_tree = [abs(r - tr) + abs(c - tc) for r, c in nuts]
        total = 2 * sum(to_tree)
        return min(
            total - a + abs(r - sr) + abs(c - sc) for a, (r, c) in zip(to_tree, nuts, strict=True)
        )