feat: add solutions to lc problem: No.0495. Teemo Attacking

Author: yanglbme

solution/0400-0499/0495.Teemo Attacking/README.md

@@ -40,7 +40,6 @@
 	<li>你可以假定提莫攻击时间序列中的数字和提莫攻击的中毒持续时间都是非负整数，并且不超过 10,000,000。</li>
 </ol>
 
-
 ## 解法
 
 <!-- 这里可写通用的实现逻辑 -->
@@ -52,15 +51,62 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def findPoisonedDuration(self, timeSeries: List[int], duration: int) -> int:
+        n, res = len(timeSeries), duration
+        for i in range(n - 1):
+            res += min(duration, timeSeries[i + 1] - timeSeries[i])
+        return res
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public int findPoisonedDuration(int[] timeSeries, int duration) {
+        int n = timeSeries.length, res = duration;
+        for (int i = 0; i < n - 1; ++i) {
+            res += Math.min(duration, timeSeries[i + 1] - timeSeries[i]);
+        }
+        return res;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int findPoisonedDuration(vector<int>& timeSeries, int duration) {
+        int n = timeSeries.size(), res = duration;
+        for (int i = 0; i < n - 1; ++i) {
+            res += min(duration, timeSeries[i + 1] - timeSeries[i]);
+        }
+        return res;
+    }
+};
+```
 
+### **Go**
+
+```go
+func findPoisonedDuration(timeSeries []int, duration int) int {
+	n, res := len(timeSeries), duration
+	for i := 0; i < n-1; i++ {
+		res += min(duration, timeSeries[i+1]-timeSeries[i])
+	}
+	return res
+}
+
+func min(a, b int) int {
+	if a < b {
+		return a
+	}
+	return b
+}
 ```
 
 ### **...**

solution/0400-0499/0495.Teemo Attacking/README_EN.md

@@ -41,21 +41,67 @@ So you finally need to output 3.
 	<li><code>timeSeries</code> is sorted in non-decreasing order.</li>
 </ul>
 
-
 ## Solutions
 
 <!-- tabs:start -->
 
 ### **Python3**
 
 ```python
-
+class Solution:
+    def findPoisonedDuration(self, timeSeries: List[int], duration: int) -> int:
+        n, res = len(timeSeries), duration
+        for i in range(n - 1):
+            res += min(duration, timeSeries[i + 1] - timeSeries[i])
+        return res
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public int findPoisonedDuration(int[] timeSeries, int duration) {
+        int n = timeSeries.length, res = duration;
+        for (int i = 0; i < n - 1; ++i) {
+            res += Math.min(duration, timeSeries[i + 1] - timeSeries[i]);
+        }
+        return res;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int findPoisonedDuration(vector<int>& timeSeries, int duration) {
+        int n = timeSeries.size(), res = duration;
+        for (int i = 0; i < n - 1; ++i) {
+            res += min(duration, timeSeries[i + 1] - timeSeries[i]);
+        }
+        return res;
+    }
+};
+```
 
+### **Go**
+
+```go
+func findPoisonedDuration(timeSeries []int, duration int) int {
+	n, res := len(timeSeries), duration
+	for i := 0; i < n-1; i++ {
+		res += min(duration, timeSeries[i+1]-timeSeries[i])
+	}
+	return res
+}
+
+func min(a, b int) int {
+	if a < b {
+		return a
+	}
+	return b
+}
 ```
 
 ### **...**

solution/0400-0499/0495.Teemo Attacking/Solution.cpp

@@ -0,0 +1,10 @@
+class Solution {
+public:
+    int findPoisonedDuration(vector<int>& timeSeries, int duration) {
+        int n = timeSeries.size(), res = duration;
+        for (int i = 0; i < n - 1; ++i) {
+            res += min(duration, timeSeries[i + 1] - timeSeries[i]);
+        }
+        return res;
+    }
+};

solution/0400-0499/0495.Teemo Attacking/Solution.go

@@ -0,0 +1,14 @@
+func findPoisonedDuration(timeSeries []int, duration int) int {
+	n, res := len(timeSeries), duration
+	for i := 0; i < n-1; i++ {
+		res += min(duration, timeSeries[i+1]-timeSeries[i])
+	}
+	return res
+}
+
+func min(a, b int) int {
+	if a < b {
+		return a
+	}
+	return b
+}

solution/0400-0499/0495.Teemo Attacking/Solution.java

@@ -0,0 +1,9 @@
+class Solution {
+    public int findPoisonedDuration(int[] timeSeries, int duration) {
+        int n = timeSeries.length, res = duration;
+        for (int i = 0; i < n - 1; ++i) {
+            res += Math.min(duration, timeSeries[i + 1] - timeSeries[i]);
+        }
+        return res;
+    }
+}

solution/0400-0499/0495.Teemo Attacking/Solution.py

@@ -0,0 +1,6 @@
+class Solution:
+    def findPoisonedDuration(self, timeSeries: List[int], duration: int) -> int:
+        n, res = len(timeSeries), duration
+        for i in range(n - 1):
+            res += min(duration, timeSeries[i + 1] - timeSeries[i])
+        return res