15 Jun 2024•C++ / Python / TypeScript•Easy

Teemo Attacking

Collected C++, Python, TypeScript solutions for teemo attacking. Add a dedicated write-up later if you want deeper notes.

View original LeetCode question

auto-generated entry for Teemo Attacking. the solution files are available below.

solution files

C++ teemo-attacking/synced-solution.cpp
Python teemo-attacking/synced-solution.py
TypeScript teemo-attacking/synced-solution.ts

Solution files

Python•teemo-attacking/synced-solution.py

class Solution:
    def findPoisonedDuration(self, timeSeries: List[int], duration: int) -> int:
        if not timeSeries:
            return class="syntax-number">0

        total = class="syntax-number">0
        for i in range(class="syntax-number">1, len(timeSeries)):
            total += min(duration, timeSeries[i] - timeSeries[i - class="syntax-number">1])
        return total + duration

C++•teemo-attacking/synced-solution.cpp

class Solution {
public:
    int findPoisonedDuration(vector<int>& timeSeries, int duration) {
        if (timeSeries.empty()) {
            return class="syntax-number">0;
        }

        int total = class="syntax-number">0;
        for (int i = class="syntax-number">1; i < static_cast<int>(timeSeries.size()); i++) {
            total += min(duration, timeSeries[i] - timeSeries[i - class="syntax-number">1]);
        }
        return total + duration;
    }
};

TypeScript•teemo-attacking/synced-solution.ts

function findPoisonedDuration(timeSeries: number[], duration: number): number {
    if (timeSeries.length === class="syntax-number">0) {
        return class="syntax-number">0;
    }

    let total = class="syntax-number">0;
    for (let i = class="syntax-number">1; i < timeSeries.length; i++) {
        total += Math.min(duration, timeSeries[i] - timeSeries[i - class="syntax-number">1]);
    }
    return total + duration;
}