Very Easy C++ Solution
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity: O(N)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: O(1)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    int findPoisonedDuration(vector<int>& time, int duration) {\n        int previous = -1;\n        int answer = 0;\n\n        for (int i : time){\n        \n            answer += duration;\n            //checking if the poisoned times are overlapping\n            if (previous >= i){\n                //removing the overlapped time from the answer\n                answer = answer -abs(previous - i) -1; \n            }\n            // keeping track of the previous time\n            previous = i + duration -1;\n        }\n        return answer;\n\n    }\n};\n```
['C++']