<p>Given an integer <code>n</code>, count <em>the total number of digit </em><code>1</code><em> appearing in all non-negative integers less than or equal to</em> <code>n</code>.</p> <p> </p> <p><strong>Example 1:</strong></p> <pre> <strong>Input:</strong> n = 13 <strong>Output:</strong> 6 </pre> <p><strong>Example 2:</strong></p> <pre> <strong>Input:</strong> n = 0 <strong>Output:</strong> 0 </pre> <p> </p> <p><strong>Constraints:</strong></p> <ul> <li><code>0 <= n <= 10<sup>9</sup></code></li> </ul>