请教这道题的时间/空间复杂度

请教一下leetcode 1868. Product of Two Run-Length Encoded Arrays。
这道题用双指针的话，他的时间、空间复杂度是多少，如何计算呢？谢谢

Linear time complexity:

• At each step, at least one of the two pointers will advance past a segment.
• There exists n+m segments in total, hence there will be at most n+m number of steps.
  

Constant space complexity (excluding input and output):

• The state consists of 4 variables: segment1, index_into_segment1, segment2, index_into_segment2.
  

carrotremoval 发表于 2021-12-17 23:51
Linear time complexity:

At each step, at least one of the two pointers will advance past a segme ...

+1

空间复杂度算上output的的话也是m+n

carrotremoval 发表于 2021-12-17 23:51
Linear time complexity:

At each step, at least one of the two pointers will advance past a segme ...

分析有道理， 非常感谢 ：）