#3697

Compute Decimal Representation

pupil · 345 · lc easy +22 · 64.6% accepted · 47 likes · top 68%

Description

Given a positive integer n, express n as a minimal-count sum of base-10 components (a single digit from 1–9 multiplied by a non-negative power of 10) and return those components sorted in descending order.

Code

1
2
3