zoukankan      html  css  js  c++  java
  • 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==1return 0;
            bool* path=new bool[n];
            for(int i=1;i<n;i++) path[i]=false;
            
            vector<int>* p1=new vector<int>();
            vector<int>* p2=new vector<int>();
            path[0]=0;
            p1->push_back(0);
            int step=0;
            
            while(p1->size()>0)
            {
                sort(p1->begin(),p1->end(),greater<int>());
                step++;
                p2->clear();
                for(int i=0;i<p1->size();i++)
                    for(int j=1;j<=A[(*p1)[i]];j++)
                        if(path[(*p1)[i]+j]==false)
                        {
                            int newindex=(*p1)[i]+j;
                            path[newindex]=true;
                            p2->push_back(newindex);
                            if(newindex==n-1return step;
                        }
              vector<int>* tmp;
              tmp=p1;
              p1=p2;
              p2=tmp;
            }
            return false;
        }
    }; 
  • 相关阅读:

    【工作】---前后端联调
    【react】---Immutable的基本使用
    【react】传值
    【原生】 HTML DOM 事件,各种事件类型、事件种类
    两台笔记本电脑之间实现屏幕扩展
    【看图学习后台管理系统】
    【bug】在react开发中,使用link 跳转中,无法点击跳转的问题
    【前端工程师】 web 安全问题
    【前端工程师】 性能和效率 优化的问题
  • 原文地址:https://www.cnblogs.com/erictanghu/p/3759367.html
Copyright © 2011-2022 走看看