【Lintcode】003.Digit Counts

题目：

Count the number of k's between 0 and n. k can be 0 - 9.

Example

if n = 12, k = 1 in

[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12]

we have FIVE 1's (1, 10, 11, 12)

题解：

Solution 1 ()

class Solution {

public:

    int digitCounts(int k, int n) {

        if (n < ) {

            return ;

        }

        int cnt = ;

        for (int i = ; i <= n; i++) {

            int num = i;

            while (num) {

                if (num %  == k) {

                    cnt++;

                }

                num = num / ;

            }

        }

        if (k ==  && n >= ) {

            cnt++;

        }

        return cnt;

    }

};

巴特西

【Lintcode】003.Digit Counts

最新文章

热门文章