class Solution {public int countDigitOne(int n) {long mulk = 1;int ans = 0;for (int k = 0; n >= mulk; ++k) {ans += (n / (mulk * 10)) * mulk + Math.min(Math.ma……
