• Home
• com.github.javadev
• leetcode-in-java
• 1.33
• source code
• readme.md

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

g0201_0300.s0233_number_of_digit_one.readme.md Maven / Gradle / Ivy

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 <= 109