solve problem Teemo Attacking

Author: P-ppc

README.md

@@ -254,6 +254,7 @@ All solutions will be accepted!
 |515|[Find Largest Value In Each Tree Row](https://leetcode-cn.com/problems/find-largest-value-in-each-tree-row/description/)|[java/py/js](./algorithms/FindLargestValueInEachTreeRow)|Medium|
 |199|[Binary Tree Right Side View](https://leetcode-cn.com/problems/binary-tree-right-side-view/description/)|[java/py/js](./algorithms/BinaryTreeRightSideView)|Medium|
 |147|[Insertion Sort List](https://leetcode-cn.com/problems/insertion-sort-list/description/)|[java/py/js](./algorithms/InsertionSortList)|Medium|
+|495|[Teemo Attacking](https://leetcode-cn.com/problems/teemo-attacking/description/)|[java/py/js](./algorithms/TeemoAttacking)|Medium|
 
 # Database
 |#|Title|Solution|Difficulty|

algorithms/TeemoAttacking/README.md

@@ -0,0 +1,2 @@
+# Teemo Attacking
+This problem is easy to solve

algorithms/TeemoAttacking/Solution.java

@@ -0,0 +1,13 @@
+class Solution {
+    public int findPoisonedDuration(int[] timeSeries, int duration) {
+        int res = 0,
+            lastTime = -1;
+        
+        for (int time : timeSeries) {
+            res += lastTime == -1 ? 0 : Math.min(time - lastTime, duration);
+            lastTime = time;
+        }
+        
+        return res + (lastTime == -1 ? 0 : duration);
+    }
+}

algorithms/TeemoAttacking/solution.js

@@ -0,0 +1,17 @@
+/**
+ * @param {number[]} timeSeries
+ * @param {number} duration
+ * @return {number}
+ */
+var findPoisonedDuration = function(timeSeries, duration) {
+    let res = 0,
+        lastTime = -1
+    
+    timeSeries.forEach(time => {
+        res += (lastTime != -1 ? Math.min(time - lastTime, duration) : 0)
+        lastTime = time
+    })
+    res += lastTime != -1 ? duration : 0
+    
+    return res
+};

algorithms/TeemoAttacking/solution.py

@@ -0,0 +1,17 @@
+class Solution(object):
+    def findPoisonedDuration(self, timeSeries, duration):
+        """
+        :type timeSeries: List[int]
+        :type duration: int
+        :rtype: int
+        """
+        res = 0
+        
+        lastTimeSerie = None
+        for timeSerie in timeSeries:
+            if lastTimeSerie != None:
+                res += min(timeSerie - lastTimeSerie, duration)
+            lastTimeSerie = timeSerie
+        res += duration if lastTimeSerie else 0
+        return res
+