-
[LeetCode] 4. Median of Two Sorted ArraysLife/PS 2026. 5. 14. 13:07

If you have studied CLRS, you may come up with a similar idea. As a side note, it does not have to be the median; you can find the t-th element of the concatenated array in $O(\log(n+m))$ time.

'Life > PS' 카테고리의 다른 글
[LeetCode] 23. Merge k Sorted Lists (0) 2026.05.18 [LeetCode] 10. Regular Expression Matching (0) 2026.05.15 트리의 지름: Diameter of Tree (0) 2026.03.30 백준 1956번 운동 (0) 2026.02.19 백준 1202 보석 도둑 (boj/1202.cpp) (0) 2024.01.30