#711 · #656 · Coin Path(金币路径)

Given an integer array coins, where 0 marks a position you may not land on, and an integer maxJump, find a path from index 0 to index n - 1 in which each jump advances between 1 and maxJump positions and the total cost (the sum of landed coins, including both endpoints) is minimised. Return the path as a list of 1-indexed positions, or an empty list if none exists. Constraints: 1 <= n <= 1000, 0 <= coins[i] <= 10^4, 1 <= maxJump <= 1000.