暴力法 思路: 按照函数调用的递归树,记录符合条件的跳跃操作: python代码: class Solution: def __init__(self): self.solutions = 0 pass def jump(self, start, end): if start > end: return 0 elif start == end: return 1 return self.jump(start + 1, end) + self.ju