495. Teemo Attacking
package LeetCode_495 /** * 495. Teemo Attacking * https://leetcode.com/problems/teemo-attacking/ * In LOL world, there is a hero called Teemo and his attacking can make his enemy Ashe be in poisoned condition. * Now, given the Teemo's attacking ascending time series towards Ashe and the poisoning time duration per Teemo's attacking, * you need to output the total time that Ashe is in poisoned condition. You may assume that Teemo attacks at the very beginning of a specific time point, and makes Ashe be in poisoned condition immediately. Example 1: Input: [1,4], 2 Output: 4 Explanation: At time point 1, Teemo starts attacking Ashe and makes Ashe be poisoned immediately. This poisoned status will last 2 seconds until the end of time point 2. And at time point 4, Teemo attacks Ashe again, and causes Ashe to be in poisoned status for another 2 seconds. So you finally need to output 4. Example 2: Input: [1,2], 2 Output: 3 Explanation: At time point 1, Teemo starts attacking Ashe and makes Ashe be poisoned. This poisoned status will last 2 seconds until the end of time point 2. However, at the beginning of time point 2, Teemo attacks Ashe again who is already in poisoned status. Since the poisoned status won't add up together, though the second poisoning attack will still work at time point 2, it will stop at the end of time point 3. So you finally need to output 3. Note: 1. You may assume the length of given time series array won't exceed 10000. 2. You may assume the numbers in the Teemo's attacking time series and his poisoning time duration per attacking are non-negative integers, which won't exceed 10,000,000. * */ class Solution { /* * solution: Greedy, check diff of every two time, if diff large than duration, result sum up with duration, otherwise sum up with diff, * Time:O(n), Space:O(1) * */ fun findPoisonedDuration(timeSeries: IntArray, duration: Int): Int { if (timeSeries == null || timeSeries.isEmpty()) { return 0 } var result = duration//because attacked in time point 1 for (i in 1 until timeSeries.size) { val diff = timeSeries[i] - timeSeries[i - 1] if (diff > duration) { result += duration } else { result += diff } } return result } }
【推荐】国内首个AI IDE,深度理解中文开发场景,立即下载体验Trae
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步
· AI与.NET技术实操系列(二):开始使用ML.NET
· 记一次.NET内存居高不下排查解决与启示
· 探究高空视频全景AR技术的实现原理
· 理解Rust引用及其生命周期标识(上)
· 浏览器原生「磁吸」效果!Anchor Positioning 锚点定位神器解析
· DeepSeek 开源周回顾「GitHub 热点速览」
· 物流快递公司核心技术能力-地址解析分单基础技术分享
· .NET 10首个预览版发布:重大改进与新特性概览!
· AI与.NET技术实操系列(二):开始使用ML.NET
· .NET10 - 预览版1新功能体验(一)
2019-01-08 不用temp,对两个数的值进行互换