有一个整数n,写一个函数f(n),返回0到n之间出现的"1"的个数

本文介绍了一个C#程序,该程序能够计算指定范围内所有数字中特定字符出现的总次数。通过两个函数实现:一个是计算从0到指定数字范围内特定字符出现的总次数;另一个是在单个数字中计算特定字符的出现次数。

拓展延伸:

有一个整数n,写一个函数f(n,k),返回0到n之间出现的"k"的个数,0<=k<10

my codes as below:

class Program

{

static void Main(string[] args)

{

//Test samples: //Expected results:

Console.WriteLine(TotalCountForNumbersSinceZero(-20,1)); //12

Console.WriteLine(TotalCountForNumbersSinceZero(20, 1)); //12

Console.WriteLine(TotalCountForNumbersSinceZero(0, 1)); //0

Console.WriteLine(TotalCountForNumbersSinceZero(-20, 0)); //3

Console.WriteLine(TotalCountForNumbersSinceZero(20, 0)); //3

Console.WriteLine(TotalCountForNumbersSinceZero(0, 0)); //1

Console.WriteLine(TotalCountForNumbersSinceZero(20, 11)); //0

Console.ReadKey();

}

/// <summary>

/// To count the appearance times of x in numbers from zero to lastNumber

/// </summary>

/// <param name="lastNumber"></param>

/// <param name="x"></param>

/// <returns></returns>

static int TotalCountForNumbersSinceZero(int lastNumber, int x)

{

if (lastNumber < 0)

lastNumber = -lastNumber;

int totalCount = 0;

for (int i = 0; i <= lastNumber; i++)

{

totalCount += CountForSingleNumber(i, x);

}

return totalCount;

}

/// <summary>

/// To count the appearance times of x in number

/// </summary>

static int CountForSingleNumber(int number, int x)

{

if (x > 9 || x < 0)

{

return 0;

}

int count = 0;

do

{

if (number % 10 == x)

{

count++;

}

number = (number - number % 10) / 10;

}

while (number != 0);

return count;

}

}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值