i*****a
发帖数: 572 | 1 most frequent sum of 3 int arrays
array1: {1, 2, 3}
array2: {1, 1, 2}
array3: {2, 3, 4}
should return 6
can't think of a data structure that is more efficient than brute force. can
someone help? | d******b
发帖数: 73 | 2 I think the answer should be 4 |
|
