3919. Minimum Cost to Move Between Indices

You are given an integer array nums where nums is strictly increasing. For each index x, let closest(x) be the adjacent index y such that abs(nums[x] - nums[y]) is minimized. If both adjacent indices exist and give the same difference, choose the smaller index. From any index x, you can move in two ways: - To any index y with cost abs(nums[x] - nums[y]), or - To closest(x) with cost 1. You ar