回複:之前冬瓜太郎的題

來源: gpm 2009-08-25 09:52:45 [] [舊帖] [給我悄悄話] 本文已被閱讀: 次 (334 bytes)
hi dynamic , thanks for you solution but I do not understand your idea, could you try figure out it by other easy way. and for the problem could we use two truing machine .... one read B1 - Bn one by one and put it in memory and other machine write it in end of list in same time. use constant memory -- just store one b and O(n) time
請您先登陸,再發跟帖!

發現Adblock插件

如要繼續瀏覽
請支持本站 請務必在本站關閉/移除任何Adblock

關閉Adblock後 請點擊

請參考如何關閉Adblock/Adblock plus

安裝Adblock plus用戶請點擊瀏覽器圖標
選擇“Disable on www.wenxuecity.com”

安裝Adblock用戶請點擊圖標
選擇“don't run on pages on this domain”