45. Jump Game II

最新推荐文章于 2022-05-06 17:05:28 发布
原创 最新推荐文章于 2022-05-06 17:05:28 发布 · 165 阅读 · 0 ·
CC 4.0 BY-SA版权
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
文章标签：

#leetcode-java

本文介绍了一种解决Jump Game II问题的有效算法。该算法通过跟踪可达最远位置和每一步覆盖范围来确定最少跳跃次数。文章包含了一个清晰的Java实现示例。

45. Jump Game II

题目已经假定可以达到终点
step记录步数，reachInStep记录在step内可到达的最大距离，reach在遍历nums时记录0到i中的最大可到达距离，reachInStep一旦小于i就说明必须要再走一步。

class Solution {
    public int jump(int[] nums) {
        int step = 0;
        int reach = 0;
        int reachInStep = 0;
        for(int i = 0; i<nums.length;i++){
            if(reachInStep<i){
                reachInStep = reach;
                step++;
            }
            reach = Math.max(reach,nums[i]+i);
        }
        return step;
    }
}
LeetCode 45. Jump Game II--当前元素值表示能跳跃的最大长度，求跳跃到最后一个元素的最少跳跃次数--贪心算法
Top5软件工程硕士，先后在京东、字节从事多年Java后端开发、实时和离线大数据开发
11-13 877
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...
[leetcode]45. Jump Game II 跳棋游戏2 C++/PYTHON实现【hard难度】
zl87758539的专栏
06-17 2192
题目 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 go
LeetCode - 45. Jump Game II
weixin_34293141的博客
03-08 156
45. Jump Game II  Problem's Link  ---------------------------------------------------------------------------- Mean:  给定一个数组a，玩家的初始位置在idx=0，玩家需要到达的位置是idx=a.size()-1. 如果玩家在idx处，...
45 jump-game-ii
qq_29592167的博客
10-18 306
这道题目和以前一道能不能跳到最后一点的题目有比较类似的思路，但是要稍微难一点，因为要求出最小的跳数。 题目的大体意思是这样的，给定一个一维数组，数组中每一位上的数字表示从该位置能向后一跳的最远距离是多少（之所以说最远是可以在0~最远值之间任意选择一个合适的数值），问到达最后一个位置所经历的最小跳数。这种题目基本上穷举是肯定不行的，因此，要有一些小的处理技巧。另外，值得注意的是，这道题给出的所有测...
[LeetCode]45. Jump Game II
gqk289的专栏
02-23 292
https://leetcode.com/problems/jump-game-ii/?tab=Description 找到最小跳到末尾的步数 从start开始跳最远能跳到end，内层扫start~end，找到这里面能到的最远位置 public class Solution { public int jump(int[] nums) { if (n
fuxuemingzhu#Leetcode-Solution-All#55. Jump Game 跳跃游戏1
07-25
1.贪心算法中，作出的每步贪心决策都无法改变，因为贪心策略是由上一步的最优解推导下一步的最优解，而上一步之前的最优解则不作保留 2.由（1）中的介绍，可以知道贪
wechat_jump_game-master.zip_python 小游戏_wechat. jump game_wechat_
09-20
【微信跳一跳小游戏Python实现详解】 微信跳一跳是一款风靡一时的微信小程序游戏，玩家需要控制小人精准地跳跃到每个平台上，积累分数。本文将深入探讨如何使用Python编程语言来自动化实现微信跳一跳的小游戏过程。...
动态规划系列(三)：LeetCode 55. Jump Game(青蛙跳跃游戏)
坚持在Android领域深耕、突破、创新。
05-06 1023
LeetCode 55. Jump Game(青蛙跳跃游戏)
LeetCode --- 45. Jump Game II
makuiyu的专栏
02-10 1780
题目链接：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 positio
import pygame import time class Fighter: def __init__(self, x, y, image_path, attack_image_path): self.x = x self.y = y self.speed = 2 self.image = pygame.image.load(image_path) self.attack_image = pygame.image.load(attack_image_path) self.is_jumping = False self.jump_height = 15 self.jump_count = self.jump_height self.health = 100 self.is_attacking = False self.last_attack_time = 0 self.attack_delay = 0.3 def draw(self, screen): if self.is_attacking: screen.blit(self.attack_image, (self.x, self.y)) else: screen.blit(self.image, (self.x, self.y)) def move(self, keys): pass def attack(self, enemy): current_time = time.time() if current_time - self.last_attack_time >= self.attack_delay: if abs(self.x - enemy.x) <= 50: enemy.health -= 2 if enemy.health < 0: enemy.health = 0 self.is_attacking = True self.last_attack_time = current_time else: self.is_attacking = False class Fighter1(Fighter): def move(self, keys): if keys[pygame.K_a] and self.x > 0: self.x -= self.speed if keys[pygame.K_d] and self.x < 750: self.x += self.speed if keys[pygame.K_k] and not self.is_jumping: self.is_jumping = True if self.is_jumping: if self.jump_count >= -self.jump_height: neg = 1 if self.jump_count < 0: neg = -1 self.y -= (self.jump_count ** 2) * 0.5 * neg self.jump_count -= 1 else: self.is_jumping = False self.jump_count = self.jump_height if keys[pygame.K_j]: self.attack(fighter2) else: self.is_attacking = False class Fighter2(Fighter): def __init__(self, x, y, image_path, attack_image_path): super().__init__(x, y, image_path, attack_image_path) self.image = pygame.transform.scale(self.image, (int(self.image.get_width() * 0.5), int(self.image.get_height() * 0.5))) self.attack_image = pygame.transform.scale(self.attack_image, (int(self.attack_image.get_width() * 0.5), int(self.attack_image.get_height() * 0.5))) def move(self, keys): if keys[pygame.K_LEFT] and self.x > 0: self.x -= self.speed if keys[pygame.K_RIGHT] and self.x < 750: self.x += self.speed if keys[pygame.K_KP2] and not self.is_jumping: self.is_jumping = True if self.is_jumping: if self.jump_count >= -self.jump_height: neg = 1 if self.jump_count < 0: neg = -1 self.y -= (self.jump_count ** 2) * 0.5 * neg self.jump_count -= 1 else: self.is_jumping = False self.jump_count = self.jump_height if keys[pygame.K_KP1]: self.attack(fighter1) else: self.is_attacking = False def draw_health_bars(screen, fighter1, fighter2): BAR_LENGTH = 300 BAR_HEIGHT = 20 # 角色 1 的血条 fill1 = (fighter1.health / 100) * BAR_LENGTH outline_rect1 = pygame.Rect(20, 20, BAR_LENGTH, BAR_HEIGHT) fill_rect1 = pygame.Rect(20, 20, fill1, BAR_HEIGHT) pygame.draw.rect(screen, (255, 0, 0), outline_rect1, 2) pygame.draw.rect(screen, (0, 255, 0), fill_rect1) # 角色 2 的血条 fill2 = (fighter2.health / 100) * BAR_LENGTH outline_rect2 = pygame.Rect(480, 20, BAR_LENGTH, BAR_HEIGHT) fill_rect2 = pygame.Rect(480, 20, fill2, BAR_HEIGHT) pygame.draw.rect(screen, (255, 0, 0), outline_rect2, 2) pygame.draw.rect(screen, (0, 255, 0), fill_rect2) pygame.init() width, height = 800, 600 screen = pygame.display.set_mode((width, height)) pygame.display.set_caption("格斗游戏") background_image = pygame.image.load("background.jpg") background_image = pygame.transform.scale(background_image, (width, height)) fighter1 = Fighter1(100, 500, "webwxgetmsgimg.jpg", "attack1.jpg") fighter2 = Fighter2(600, 500, "_cgi-bin_mmwebwx-bin_webwxgetmsgimg__&MsgID=4151463399841909084&skey=@crypt_3b46ed7a_7efc25287b2eeaad8d2392b1642162ed&mmweb_appid=wx_webfilehelper.jpg", "attack2.jpg") running = True while running: for event in pygame.event.get(): if event.type == pygame.QUIT: running = False keys = pygame.key.get_pressed() fighter1.move(keys) fighter2.move(keys) screen.blit(background_image, (0, 0)) draw_health_bars(screen, fighter1, fighter2) fighter1.draw(screen) fighter2.draw(screen) pygame.display.flip() pygame.quit() 我要让角色的跳跃高度降低
最新发布
10-29
pygame.display.set_caption("Fighting Game") fighter1 = Fighter(100, 400, "fighter1.png", "fighter1_attack.png") fighter2 = Fighter(600, 400, "fighter2.png", "fighter2_attack.png") running = True ...
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值