zoukankan      html  css  js  c++  java
  • Jump Game

    1.

    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.

    Example:

    Input: [2,3,1,1,4]
    Output: 2
    Explanation: 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.

    Note:

    You can assume that you can always reach the last index.

    class Solution {
    public:
        int jump(vector<int>& nums) {
            int len = nums.size(),start = 0,end = 0, step = 0;
            while (end < len - 1)
            {
                ++step;
                int maxEnd = end + 1;
                for (int i = start; i <= end; ++i)
                {
                    if (nums[i] + i > len - 1) return step;
                    maxEnd = max(nums[i] + i,maxEnd);
                }
                start = end + 1;
                end = maxEnd;
            }
            return step;
        }
    };

    2.

    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.

    Determine if you are able to reach the last index.

    Example 1:

    Input: [2,3,1,1,4]
    Output: true
    Explanation: Jump 1 step from index 0 to 1, then 3 steps to the last index.
    

    Example 2:

    Input: [3,2,1,0,4]
    Output: false
    Explanation: You will always arrive at index 3 no matter what. Its maximum
                 jump length is 0, which makes it impossible to reach the last index.
    // trace back
    class Solution {
    public:
        bool canJump(vector<int>& nums) {
            int len = nums.size();
            if (len == 1)return true;
            int max_index = 0;
            for (int i = 0; i <= max_index;++i)
            {
                if (nums[i] + i >= len - 1)return true;
                if (max_index < i)return false;
                max_index = max(max_index,nums[i] + i);
            }
            return false;
        }
    };
  • 相关阅读:
    HttpRuntime.Cache的使用经验
    js 字符串中取得第一个字符和最后一个字符
    CSAPP笔记-第一章
    共和党减税法案的个人减税
    bash学习进行中
    建站日志
    Python学习进行中
    Check your data! 数据预处理血泪教训
    bash
    【python技巧系列】在循环中处理异常并继续运行
  • 原文地址:https://www.cnblogs.com/qiang-wei/p/11908910.html
Copyright © 2011-2022 走看看