45-Jump Game II

類別：BFS 難度：hardweb 題目描述 代碼實現 int jump(vector<int>& nums) { int n = nums.size(); if (n < 2) return 0; int level = 0, i = 0, curMax = 0, nextMax = 0; // 節點下標 while (curMax - i + 1 > 0

>>阅读原文<<