PTT職涯區 / Oversea_Job (海外工作)

[北美] Microsoft questions

看板Oversea_Job (海外工作)作者時間17年前 (2007/12/15 03:45), 編輯推噓1(1推 0噓 0→)
留言1則, 1人參與, 最新討論串1/4 (看更多)
Given 2 sorted arrays, a[] and b[] combine them with no extra array(or linear space). e.g.: a[10] = [1, 3, 5, 7, 9] b[3] = [2, 4, 6] the result is a[] = [1, 2, 3, 4, 5, 6, 7, 9], assuming a[] has enough space. Can anyone solve it? I don't see a good solution(meaning O(N)) yet. -- ※ 發信站: 批踢踢參(ptt3.cc) ◆ From: 70.20.254.187
推
12/15 05:53, , 1F
O(5+3) is still O(N) <-- I think that's the solution
12/15 05:53, 1F
‣ 更多 LINC. 的文章
文章代碼(AID): #17OjrN00 (Oversea_Job)
Oversea_Job 近期熱門文章
更多 近期熱門文章 >>
PTT職涯區 即時熱門文章
更多 即時熱門文章 >>
‣ 更多 LINC. 的文章
文章代碼(AID): #17OjrN00 (Oversea_Job)