You have tick data for Stock A and Stock B in two massive sorted arrays. They update at different times. How do you construct an aligned dataset where each tick of A is matched with the most recent price of B, in O(N) time and O(1) extra space?

你有股票A和股票B的两个巨型有序tick时间戳数组，它们更新不同步。你怎么在O(N)时间和O(1)额外空间内，把A的每一个tick与B最新出现的价格对齐？