LeetCode--495

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], 2Output: 4Explanation: 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], 2Output: 3Explanation: 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:
You may assume the length of given time series array won’t exceed 10000.
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.
Subscribe to see which companies asked this question.

算法思想

1. 先判断是否攻击次数为0，即数组是否为空；
2. 判断数组中攻击间隔是否大于中毒期，大于中毒期，中毒总时长+中毒期，小于中毒期，中毒总时长+攻击间隔期；

代码实现

class Solution {public:    int findPoisonedDuration(vector<int>& timeSeries, int duration) {        if(timeSeries.size()==0) return 0;//没有中毒        int sum=duration;//最后一次攻击        for(int i=1; i<timeSeries.size(); i++){            if(timeSeries[i]-timeSeries[i-1]>duration){//攻击间隔大于中毒期                sum+=duration;            }            else sum+=timeSeries[i]-timeSeries[i-1];//攻击间隔小于中毒期        }        return sum;    }};

碎言碎语

1. 刷了几道LeetCode，发现按照题目顺序去刷，效果不明显，决定分主题刷~
2. 选了第一个主题array，今天2.26；立下flag，3.20刷完该主题！