Maximize User Entertainment with O(n) TikTok Algorithm

bytedance You need to design an algorithm to maximize user entertainment when watching TikTok. Assume there are two arrays that store the left maximum and right maximum viewing content requirements of the user, respectively. Traverse with the middle maximum value. The algorithm complexity requirement is O(n). Please provide a complete code implementation. Example Input [1, 3, 5, 7, 9] [9, 7, 5, 3, 1] [2, 4, 6, 8, 10]