zoukankan      html  css  js  c++  java
  • 495. 提莫攻击 Teemo Attacking

    In LLP 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.
    题意:给出攻击的时间点,以及中毒debuff持续时间,求出敌人总共的中毒时间
    1. public class Solution {
    2. public int FindPoisonedDuration(int[] timeSeries, int duration) {
    3. int sum = 0;
    4. for (int i = 1; i < timeSeries.Length; i++) {
    5. var offset = timeSeries[i] - timeSeries[i - 1];
    6. sum += offset > duration ? duration : offset;
    7. }
    8. return timeSeries.Length > 0 ? sum + duration : sum;
    9. }
    10. }





  • 相关阅读:
    sqlserver实现树形结构递归查询(无限极分类)
    我所理解的Delphi中的数组类型
    Delphi CreateMutex 防止程序多次运行
    CreateMutex和WaitForSingleObject组合的有关问题
    SqlServer 递归查询树形数据
    XE5 Android 开发实现手机打电话和发短信 [转]
    ShowModal在FireMonkey移动应用程序对话框
    xe5 android 控制蓝牙[转]
    xe5 android 调用照相机获取拍的照片[转]
    xe5 android sample 中的 SimpleList 是怎样绑定的 [转]
  • 原文地址:https://www.cnblogs.com/xiejunzhao/p/bee3e9f5a795a0e730ab8f30a2ce690a.html
Copyright © 2011-2022 走看看