zoukankan      html  css  js  c++  java
  • leetcode[45]Jump Game II

    Given an array of non-negative integers, you are initially positioned at the first index of the array.

    Each element in the array represents your maximum jump length at that position.

    Your goal is to reach the last index in the minimum number of jumps.

    For example:
    Given array A = [2,3,1,1,4]

    The minimum number of jumps to reach the last index is 2. (Jump 1 step from index 0 to 1, then 3 steps to the last index.)

    class Solution {
    public:
        int jump(int A[], int n) {
        if(n<=1)return 0;
        int pre=n-1;
        int curr=n-1;
        int len=0;
        while(curr)
        {
            for (int i=pre-1;i>=0;i--)
            {
                if(i+A[i]>=pre)
                {
                    if(i<curr)curr=i;
                }
            }
            pre=curr;
            len++;
        }
        return len;
        }
    };
  • 相关阅读:
    centos 修改语言、时区
    去除 ufeff
    Docker介绍及使用
    消息队列
    数据结构与算法
    Haystack
    Python面向对象之魔术方法
    关于Redis处理高并发
    Redis
    RESTful规范
  • 原文地址:https://www.cnblogs.com/Vae1990Silence/p/4283569.html
Copyright © 2011-2022 走看看