Home > Back-end >  Daniel, algorithm.
Daniel, algorithm.

Time:11-30

Sequence (which may be repeated) :,4,18,2,23,9,11 {3}.
Given value: V

Selected a few from the sequence of the sum to the closest v. (permissible error + - X)

If need to use greedy algorithm? Would you please give ideas.