781. Count all Digits of a Number

You are given an integer n. You need to return the number of digits in the number.

The number will have no leading zeroes, except when the number is 0 itself.

Example 1:

Input: n = 4

Output: 1

Explanation: There is only 1 digit in 4.

Example 2:

Input: n = 14

Output: 2

Explanation: There are 2 digits in 14.

Now Your Turn!

Pick the correct output for the given input

Input: n = 234

Still unsure what the problem is asking ?

Let’s go through a few more examples, step by step, to make it clearer.

Constraints:

  • 0 <= n <= 5000
  • n will contain no leading zeroes except when it is 0 itself.
0
class Solution {
public:
int countDigit(int n) {
 
}
};
Test Case

Input:

N