zoukankan      html  css  js  c++  java
  • 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
        }
    }
  • 相关阅读:
    NFC技术:让Android自动打开网页
    NFC技术:让Android自动运行程序
    NFC技术:概述
    路由器端口映射实现外网访问本地服务器
    Java之MySql数据库链接
    最短路径之Dijkstra算法及实例分析
    各种排序算法的时间性能比较
    C#实现基于ffmpeg加虹软的人脸识别
    虹软SDK在nodejs中的集成
    Android 虹软2.0人脸识别,注册失败问题 分析synchronized的作用
  • 原文地址:https://www.cnblogs.com/johnnyzhao/p/14251451.html
Copyright © 2011-2022 走看看