Simple Java Solution | O(n) | Faster than 100%
```\npublic int findPoisonedDuration(int[] timeSeries, int duration) {\n        if (timeSeries.length == 0) return 0;\n        \n        int result = duration;\
```\npublic int findPoisonedDuration(int[] timeSeries, int duration) {\n        if (timeSeries.length == 0) return 0;\n        \n        int result = duration;\n        \n        for (int i = 1; i < timeSeries.length; i++) {\n            result += Math.min(duration, timeSeries[i] - timeSeries[i - 1]);\n        }\n        \n        return result;\n    }
[]