CodePudding
Home
front end
Back-end
Net
Software design
Enterprise
Blockchain
Mobile
Software engineering
database
OS
other
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.
Page link:
https//www.codepudding.com/Backend/89767.html
Prev:
Of the new turn
Next:
Of the new turn
Tags:
Java related
Related
Python BeautifulSoup do crawler for Daniel advice!!!!! Crawl
SQL questions asked Daniel wu solutions
Computer by remote control. And Daniel to solve
Daniel, the spring integration mybatis appear this mistake h
Daniel, please give directions, the server at the same time
Daniel, using C language implementation of WCDMA communicati
Dear Daniel, how to use Delphi vornoi figure?
Daniel, please do and equipment
6.0 huawei mobile phones running software flash back. Ask Da
Similar to the function of the ps magic wand, a great god gi
Links:
CodePudding