Solution (leetcode-in-java 1.19 API)

java.lang.Object
- g0201_0300.s0233_number_of_digit_one.Solution

```
public class Solution
extends Object
```
233 - Number of Digit One.
Hard

Given an integer n, count the total number of digit 1 appearing in all non-negative integers less than or equal to n.

Example 1:

Input: n = 13

Output: 6

Example 2:

Input: n = 0

Output: 0

Constraints:
- 0 <= n <= 10⁹

- Constructor Summary
  
  Constructors
  Constructor Description
  
  Solution()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  int countDigitOne(int n)
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
public Solution()
```

Method Detail
- countDigitOne
```
public int countDigitOne(int n)
```