🐍 Clean & Concise || Very-Easy || 91% faster 📌📌
IDEA:\n\uD83D\uDC49Since list is given in non-decreasing order, we dont have to bother about the sorting. \n\uD83D\uDC49 Directly we can check that if we poison
## IDEA:\n\uD83D\uDC49*Since list is given in non-decreasing order, we dont have to bother about the sorting. \n\uD83D\uDC49 Directly we can check that if we poisoned ash then for how long time it would be in sleep mode, which is **timeseries[i]+duration-1**. \n\uD83D\uDC49 If this time is less then the next poisioning time then directly we will add the difference as a sleeping time. \n\uD83D\uDC49 But If it gets exceede or equal to next poisioning time then directly we can add the difference of these two adjacent number and contiue the loop.\n\uD83D\uDC49 At last we have to add the duration because after giving final poison it will remain in sleep mode for "duration"  time.*\n\'\'\'\n\n\tclass Solution:\n    def findPoisonedDuration(self, timeSeries: List[int], duration: int) -> int:\n        \n        res = 0\n        for i in range(len(timeSeries)-1):\n            s = timeSeries[i]+duration-1\n            if s<timeSeries[i+1]:\n                res+=s-timeSeries[i]+1\n            else:\n                res+=timeSeries[i+1]-timeSeries[i]\n                \n        res+=duration\n        return res\n\n**Thanks & Upvote !!** \uD83E\uDD1E\nFeel free to ask if you have any doubt. \uD83E\uDD33
['Python', 'Python3']