题目:
Given an integer n, count the total number of digit 1 appearing in all non-negative integers less than or equal to n.
For example:
Given n = 13,
Return 6, because digit 1 occurred in the following numbers: 1, 10, 11, 12, 13.
给定一个整数n,计算所有小于等于n的非负整数中数字1出现的次数。
例如:
给定 n = 13,
返回6, 因为数字1在下面的数字中出现:1, 10, 11, 12, 13(共6次)。
解法一:
package com.liangdianshui;
import java.util.Scanner