[問題] 未排序的陣列，演算法相關問題
given two unsorted arrays X and Y,
each contains m and n numbers, separately.
design an algorithm so that,
given a number d,
it could determine if there exists two integers i and j,
such that X[i] + Y[i] = d
use less than O(m*n) running time
我想請問這題大致上從哪方面下手會比較簡易
謝謝
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 61.228.27.232
推
05/09 01:56, , 1F
05/09 01:56, 1F
推
05/09 03:26, , 2F
05/09 03:26, 2F
→
05/09 09:57, , 3F
05/09 09:57, 3F
推
05/09 22:12, , 4F
05/09 22:12, 4F
→
05/09 22:13, , 5F
05/09 22:13, 5F
討論串 (同標題文章)
以下文章回應了本文 (最舊先)：
完整討論串 (本文為第 1 之 13 篇)：
CSSE 近期熱門文章
PTT數位生活區 即時熱門文章
