Leetcode_jump-game (updated c++ and python version)

最新推荐文章于 2014-09-07 19:47:51 发布

fibo_nacci

最新推荐文章于 2014-09-07 19:47:51 发布

阅读量589

点赞数

分类专栏： Leetcode python c++

本文链接：https://blog.csdn.net/flyupliu/article/details/22186103

版权

Leetcode 同时被 3 个专栏收录

155 篇文章 0 订阅

订阅专栏

c++

62 篇文章 0 订阅

订阅专栏

python

52 篇文章 0 订阅

订阅专栏

地址：http://oj.leetcode.com/problems/jump-game/

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.

For example:
A = [2,3,1,1,4], return true.

A = [3,2,1,0,4], return false.

思路：遍历，在当前位置x求最远能到达的位置y, 若x+1<=y 则求在x+1的位置求最远能到达的位置y^. 如此遍历下去，看能否大于等于n-1.

参考代码：

class Solution {
public:
    bool canJump(int A[], int n) {
        if(n)
        {
        int maxlen = A[0];
        for(int i = 0; i < n && i<=maxlen; ++i)
        {
            if(i+A[i]>maxlen)
            {
                maxlen = i+A[i];
            }
        }
        return maxlen>=n-1 ? true : false;
        }
        return true;
    }
};

 
 
  
  //SECOND TRAIL
 
 
 
 
  
  class 
  
  Solution 
  
  {
 
 
 
 
  
  public
  
  :
 
 
 
 
  
      
  
  bool 
  
  canJump
  
  (
  
  int 
  
  A
  
  [], 
  
  int 
  
  n
  
  ) 
  
  {
 
 
 
 
  
          
  
  if
  
  (
  
  !
  
  A 
  
  || 
  
  n
  
  <
  
  0
  
  )
 
 
 
 
  
              
  
  return 
  
  false
  
  ;
 
 
 
 
  
          
  
  if
  
  (
  
  n
  
  ==
  
  1
  
  )
 
 
 
 
  
              
  
  return 
  
  true
  
  ;
 
 
 
 
  
          
  
  int 
  
  cur 
  
  = 
  
  0
  
  , 
  
  end 
  
  = 
  
  A
  
  [
  
  0
  
  ], 
  
  maxstep 
  
  = 
  
  0
  
  ;
 
 
 
 
  
          
  
  while
  
  (
  
  1
  
  )
 
 
 
 
  
          
  
  {
 
 
 
 
  
              
  
  while
  
  (
  
  cur
  
  <=
  
  end
  
  )
 
 
 
 
  
              
  
  {
 
 
 
 
  
                  
  
  maxstep 
  
  = 
  
  max
  
  (
  
  maxstep
  
  , 
  
  cur
  
  +
  
  A
  
  [
  
  cur
  
  ]);
 
 
 
 
  
                  
  
  ++
  
  cur
  
  ;
 
 
 
 
  
                  
  
  if
  
  (
  
  maxstep
  
  >=
  
  n
  
  -
  
  1
  
  )
 
 
 
 
  
                      
  
  return 
  
  true
  
  ;
 
 
 
 
  
              
  
  }
 
 
 
 
  
              
  
  if
  
  (
  
  maxstep
  
  <=
  
  end
  
  )
 
 
 
 
  
                  
  
  return 
  
  false
  
  ;
 
 
 
 
  
              
  
  cur 
  
  = 
  
  end
  
  ;
 
 
 
 
  
              
  
  end 
  
  = 
  
  maxstep
  
  ;
 
 
 
 
  
              
  
  maxstep 
  
  = 
  
  0
  
  ;
 
 
 
 
  
          
  
  }
 
 
 
 
  
          
  
  return 
  
  false
  
  ;
 
 
 
 
  
      
  
  }
 
 
 
 
  
  };

python:

 
 
  
  class 
  
  Solution
  
  :
 
 
 
 
  
      
  
  # @param A, a list of integers
 
 
 
 
  
      
  
  # @return a boolean
 
 
 
 
  
      
  
  def 
  
  canJump
  
  (
  
  self
  
  , 
  
  A
  
  ):
 
 
 
 
  
          
  
  if 
  
  not 
  
  A
  
  :
 
 
 
 
  
              
  
  return 
  
  False
 
 
 
 
  
          
  
  if 
  
  len
  
  (
  
  A
  
  )
  
  ==
  
  1
  
  :
 
 
 
 
  
              
  
  return 
  
  True
  
  ;
 
 
 
 
  
          
  
  far 
  
  = 
  
  0
 
 
 
 
  
          
  
  for 
  
  i 
  
  in 
  
  range
  
  (
  
  0
  
  , 
  
  len
  
  (
  
  A
  
  )):
 
 
 
 
  
              
  
  if 
  
  i
  
  <=
  
  far
  
  :
 
 
 
 
  
                  
  
  far 
  
  = 
  
  max
  
  (
  
  far
  
  , 
  
  i
  
  +
  
  A
  
  [
  
  i
  
  ])
 
 
 
 
  
                  
  
  if 
  
  far 
  
  >= 
  
  len
  
  (
  
  A
  
  )
  
  -
  
  1
  
  :
 
 
 
 
  
                      
  
  return 
  
  True
 
 
 
 
  
              
  
  else
  
  :
 
 
 
 
  
                  
  
  return 
  
  False
 
 
 
 
  
          
  
  return 
  
  False