g0401_0500.s0495_teemo_attacking.Solution Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java17 Show documentation
Show all versions of leetcode-in-java17 Show documentation
Java Solution for LeetCode algorithm problems, continually updating
package g0401_0500.s0495_teemo_attacking;
// #Easy #Array #Simulation #2022_07_21_Time_2_ms_(97.97%)_Space_55_MB_(14.20%)
public class Solution {
public int findPoisonedDuration(int[] timeSeries, int duration) {
if (duration == 0) {
return 0;
}
int start = timeSeries[0];
int end = timeSeries[0] + duration - 1;
int poisonDuration = end - start + 1;
for (int i = 1; i < timeSeries.length; i++) {
if (timeSeries[i] <= end) {
poisonDuration += (duration - (end - timeSeries[i] + 1));
end += (duration - (end - timeSeries[i] + 1));
} else {
start = timeSeries[i];
end = timeSeries[i] + duration - 1;
poisonDuration += end - start + 1;
}
}
return poisonDuration;
}
}