Time complexity of your solution to Integer to Roman

Question

Time complexity of your solution to Integer to Roman

DaiYue opened this issue 8 years ago · 2 comments

Great solution! Although I think the time complexity is more like O(lgn), as n being num?
Not that important anyways, since num is guaranteed to be <= 3999.

Answer 1 · 2016-12-26T19:34:21.000Z

Thank you for your comment. My point there is that n represents the length of the roman number array, I should be more clear about that.

Answer 2 · 2016-12-27T02:41:04.000Z

I see. Thank you for the explanation.