Jump Game II

    int n = nums.size(), i = 0, l = 0, k = 0;

       while (k < n - 1) {

           i++;

                         intj = k + 1;

                         for(int i = l; i <= k; i++) {

               if (i + nums[i] >= n - 1)return i;

                                  j= max(j, i + nums[i]);

                         }

           l = k + 1;

           k = j;

       }

                 returni;