495. Teemo Attacking

Author: zhaoguanchen

README.md

@@ -165,6 +165,7 @@ The project is divided into two parts: `structure` and `solution`.
 | 386  | [Lexicographical Numbers](https://leetcode.com/problems/lexicographical-numbers/) | Medium     | [LexicographicalNumbers.java](src/leetcode/solution/array/LexicographicalNumbers.java) | Recursion                                                    |
 | 412  | [Fizz Buzz](https://leetcode.com/problems/fizz-buzz/)        | Easy       | [FizzBuzz.java](src/leetcode/solution/array/FizzBuzz.java)   | For loop. Calculate i%5 and i%3 separately.                  |
 | 456  | [132 Pattern](https://leetcode.com/problems/132-pattern/)    | Medium     | [OneThreeTwoPattern.java](src/leetcode/solution/array/OneThreeTwoPattern.java) | Using Array as a Stack                                       |
+| 495  | [Teemo Attacking](https://leetcode.com/problems/teemo-attacking/) | Easy       | [TeemoAttacking.java](src/leetcode/solution/array/TeemoAttacking.java) | Simulation                                                   |
 | 768  | [Max Chunks To Make Sorted II](https://leetcode.com/problems/max-chunks-to-make-sorted-ii/) | Hard       | [MaxChunksToMakeSortedII.java](src/leetcode/solution/array/MaxChunksToMakeSortedII.java) | Iterate through the array, each time all elements to the left are smaller (or equal) to all elements to the right, there is a new chunk. |
 | 769  | [Max Chunks To Make Sorted](https://leetcode.com/problems/max-chunks-to-make-sorted/) | Medium     | [MaxChunksToMakeSorted.java](src/leetcode/solution/array/MaxChunksToMakeSortedII.java) | Iterate through the array,  each time the maximum value of all elements to the left equals the index, there is a new chunk. |
 | 953  | [Verifying an Alien Dictionary](https://leetcode.com/problems/verifying-an-alien-dictionary/) | Easy       | [VerifyingAnAlienDictionary.java](src/leetcode/solution/array/VerifyingAnAlienDictionary.java) | Compare adjacent elements                                    |

src/leetcode/solution/array/TeemoAttacking.java

@@ -0,0 +1,38 @@
+package leetcode.solution.array;
+
+/**
+ * 495. Teemo Attacking
+ */
+public class TeemoAttacking {
+
+    public static void main(String[] args) {
+        int duration = 2;
+        int[] timeSeries = {1, 4};
+        TeemoAttacking teemoAttacking = new TeemoAttacking();
+        System.out.println(teemoAttacking.findPoisonedDuration(timeSeries, duration));
+    }
+
+    public int findPoisonedDuration(int[] timeSeries, int duration) {
+        if (timeSeries.length == 0) {
+            return 0;
+        }
+
+        int total = 0;
+        int end = timeSeries[0];
+
+        for (int i = 0; i < timeSeries.length; i++) {
+            if (end > duration + timeSeries[i]) {
+                continue;
+            } else if (timeSeries[i] < end) {
+                total += timeSeries[i] + duration - end;
+                end = timeSeries[i] + duration;
+            } else {
+                total += duration;
+                end = timeSeries[i] + duration;
+            }
+        }
+
+        return total;
+
+    }
+}