C#练习题答案: 多少个零？【难度：2级】--景越C#经典编程题库,1000道C#基础练习题等你来挑战

多少个零?【难度:2级】:

答案1:

using System;

public static class Kata
{
  public static long CountZeroes(int n)
  {
    if (n <= 1) return 0;
    
    return CountZeroes(n-1) + 9 * (long)Math.Pow(10, n-2) * (n - 1);
  }
}​

答案2:

using System;
public static class Kata
{
  public static long CountZeroes(int n)
  {
    return n<2 ? 0 : long.Parse((n-2)+new string('8',n-2)+"9");
  }
}​

答案3:

using System;
public static class Kata
{
  public static decimal CountZeroes(int n)
  {
      return Math.Round((decimal)((((9 * (n - 1)) - 1) * Math.Pow(10, n - 1)) + 1) / 9);
  }
}​

答案4:

using System;

public static class Kata
{
  public static long CountZeroes(int n)
  {
    if (n <= 0)
            {
                return 0;
            }
            else if (n == 18)
            {
                return 1688888888888888889;
            }
            else if (n == 17)
            {
                return 158888888888888889;
            }
            else if (n == 16)
            {
                return 14888888888888889;
            }
            
            double counter = 0;
            for (double i = 2; i <= n; i++)
            {
                counter += 9 * (i - 1) * Math.Pow(10, (double)(i - 2));
            }
            
            return (long)counter;
  }
}​

答案5:

using System;

public static class Kata
{
  public static long CountZeroes(int n)
  {
    long result = 0;
    for(int i = 1; i < n; i++){
      long multiplier = (long)Math.Pow(10, i - 1);
      result += multiplier * 9 * i;
    }
    return result;
  }
}​

答案6:

public static class Kata
{
  public static long CountZeroes(int n)
  { 
      long c=0; for (int i=0;i<n;i++) c+=(long)System.Math.Pow(10,i-1)*9*i; return c;
  }
}​

答案7:

public static class Kata
{
    public static long CountZeroes(int n)
    {
        if (n <= 1) return 0;
        return long.Parse(string.Concat(n - 2, new string('8', n - 2), '9'));
    }
}​

答案8:

using System.Collections.Generic;
using System.Linq;
using System;
public static class Kata
{
  public static long CountZeroes(int n)
  {
  Console.Write(n);
    switch (n)
    {
    case 2:    return 9;
    case 5:    return 38889;
    case 6:    return 488889;
    case 7:    return 5888889;
    case 8:    return 68888889;
    case 9:    return 788888889;
    case 3:    return 189;
    case 4:    return 2889;
    case 10:    return 8888888889;
    case 11:    return 98888888889;
    case 12:    return 1088888888889;
    case 13:    return 11888888888889;
    case 14:    return 128888888888889;
    case 15:    return 1388888888888889;
    case 16:    return 14888888888888889;
    case 17:    return 158888888888888889;
    case 18:    return 1688888888888888889;
    default:    return 0;
    }
    }
}​

答案9:

public static class Kata
{
  public static long CountZeroes(int n)
  {
    if (n <= 1) return 0;
    return long.Parse(string.Format("{0}{1}{2}", n-2, new string('8', n-2), 9));
  }
}​

答案10:

using System.Linq;

public static class Kata
{
    public static long CountZeroes(int n)
    {
        if (n <= 1) return 0;
        
        var x = n - 2;
        var zeroes = x.ToString() + string.Concat(Enumerable.Repeat('8', x)) + "9";
        return long.Parse(zeroes);
    }
}​