How to realize the Jump Game with python

Today, I would like to share with you the relevant knowledge points about how to achieve the jump game in python. The content is detailed and the logic is clear. I believe most people still know too much about this, so share this article for your reference. I hope you can get something after reading this article. Let's take a look at it.

Topic: 55. Jump game

Given an array of non-negative integers, you are initially in the first position of the array.

Each element in the array represents the maximum length you can jump at that location.

Judge whether you can reach the last position.

Example 1:

Input: [2, 3, 1, 1, 1, 4]

Output: true

Explanation: we can jump one step first, from position 0 to position 1, and then jump 3 steps from position 1 to the last position.

Example 2:

Input: [3, 2, 1, 0, 4]

Output: false

Explanation: in any case, you will always reach the position with an index of 3. But the maximum jump length of this position is 0, so you can never reach the last position.

Solve the problem:

Use max_len to record the farthest location that can be reached, then: max_len = max (max_len, nums [I] + I)

Code:

Class Solution:

Def canJump (self, nums: List [int])-> bool:

Loop = 0

Max_len = 0

While loop max_len:

Max_len = cur_len

If max_len > = len (nums)-1:

Break

Loop + = 1

Return max_len > = len (nums)-1

These are all the contents of the article "how to achieve the jumping Game in python". Thank you for reading! I believe you will gain a lot after reading this article. The editor will update different knowledge for you every day. If you want to learn more knowledge, please pay attention to the industry information channel.