MCPcopy Create free account
hub / github.com/Flamewaker/JavaPersonalSummary / ByteDance04

Class ByteDance04

Code/exam/ByteDance04.java:11–30  ·  view source on GitHub ↗

@author todd @date 2020/6/25 13:02 @description: Z国的货币系统包含面值1元、4元、16元、64元共计4种硬币,以及面值1024元的纸币。现在小Y使用1024元的纸币购买了一件价值为N (0 < N \le 1024)N(0<N≤1024)的商品,请问最少他会收到多少硬币? 贪心算法,简单题。

Source from the content-addressed store, hash-verified

source not stored for this graph (policy: none)

Callers

nothing calls this directly

Calls

no outgoing calls

Tested by

no test coverage detected