帮着看到G家题# JobHunting - 待字闺中
s*r
1 楼
Given two sorted postive integer arrays A(n) and B(n),each array is
decreased order sorted. find n smallest sum of pair of (a, b), a belong to A
, b belong to B
Is there a O(n) algorithm ?
decreased order sorted. find n smallest sum of pair of (a, b), a belong to A
, b belong to B
Is there a O(n) algorithm ?