2453. Destroy Sequential Targets
¶
Approach 1: Hash Map¶
- Time: $O(n)$
- Space: $O(n)$
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 |
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 |
|
1 2 3 4 5 |
|
Approach 2: C++ std::max_element
¶
- Time: $O(n)$
- Space: $O(n)$
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 |
|