zoukankan      html  css  js  c++  java
  • leetcode--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.)

    public class Solution {
        public int jump(int[] A) {
           int jumps = 0;
    		int length = A.length;
    		if(length == 0 || length == 1) //tivial cases
    			return 0;
    		int currentPosition = 0;
    		int nextPosition = 0;
    		for(int i = 0; i < length; ++i){
    			if(i > currentPosition){
    				currentPosition = nextPosition;
    				++jumps;				
    			}
    			nextPosition = Math.max(nextPosition, i + A[i]);
    		}	
    		return jumps;
        }
    }
    

      

  • 相关阅读:
    vertical-align
    剑指offer刷题
    ES6 promise
    wangyi准备
    spring定时器
    xshell下linux常用操作
    HSSFWorkbook生成excel文件
    梳理并分解继承体系
    JSON格式数据转换
    部署项目
  • 原文地址:https://www.cnblogs.com/averillzheng/p/3537465.html
Copyright © 2011-2022 走看看