Why is the complexity O(N^2) and not O(N)

Question

sparshgarg23 opened this issue 5 years ago · comments

Hello,can you explain why the compexity is O(N^2) and not O(N)

kamyu · Answer 1 · Tue Jan 28 2020 18:05:33 GMT+0800 (China Standard Time)

I don't understand which problem you are asking about.
Could you give me more details?

sparshgarg23 · Answer 2 · Wed Jan 29 2020 00:14:04 GMT+0800 (China Standard Time)

Sure I will get back to you soon with the details

sparshgarg23 · Answer 3 · Wed Jan 29 2020 14:03:27 GMT+0800 (China Standard Time)

The problem is reverse substrings between each pair of parantheses(C++ )

kamyu · Answer 4 · Wed Jan 29 2020 15:17:36 GMT+0800 (China Standard Time)

About "1190. Reverse Substrings Between Each Pair of Parentheses" :

I added a real O(n) solution from Leetcode forum.
In the 2-pass solution, each character is traversed only once in each pass, so it is O(n).
Thanks for your friendly reminder.