C#练习题答案: 返回N的前M的倍数【难度:1级】--景越C#经典编程题库,1000道C#基础练习题等你来挑战

返回N的前M的倍数【难度:1级】:

答案1:

using System.Linq;

public class Kata
{
  public static double[] Multiples(int m, double n)
  {
    return Enumerable.Range(1, m).Select(x => x * n).ToArray();
  }
}

答案2:

using System.Linq;

public class Kata
{
  public static double[] Multiples(int m, double n)
    => Enumerable.Range(1, m).Select(x => (double)(n * x)).ToArray();
}

答案3:

public class Kata
{
  public static double[] Multiples(int m, double n)
  {
     double[] nums = new double[m];
            double hp = n;
            for (int i = 0;i<m; i++)
            {
                nums[i] = n;
                n += hp;
            }
            return nums;
  }
}

答案4:

 
using System.Linq;
public class Kata
    {
        public static double[] Multiples(int m, double n)
        {
           return Enumerable.Range(1, m).Select(v => v * n).ToArray();
        }
    }

答案5:

using System.Collections.Generic;

public class Kata
{
  public static double[] Multiples(int m, double n)
  {
     var doubleList = new List<double>();

    for( int i = 1; i <= m; i++ )
        doubleList.Add( i * n );

    return doubleList.ToArray();
  }
}

答案6:

using System;
using System.Collections.Generic;

public class Kata
{
  public static double[] Multiples(int m, double n)
  {
  var temp = n;
    var _list = new List<double>();
    for(int i = 0; i<m; i++){
     _list.Add(n);
     n+=temp;
    }
    return _list.ToArray();
  }
}

答案7:

using System.Collections.Generic;
public class Kata
{
  public static double[] Multiples(int m, double n)
  {
    List<double> doubleList = new List<double>();

    for( int i = 1; i <= m; i++ )
    {
        doubleList.Add( i * n );
    }

    return doubleList.ToArray();
  }
}

答案8:

using System.Collections.Generic;

public class Kata
{
  public static double[] Multiples(int m, double n)
  {
    var multiples = new List<double>();
    for (int i = 1; i <= m; i++)
    {
      multiples.Add(n * i);
    }
    return multiples.ToArray();
  }
}

答案9:

using System;
using System.Collections.Generic;
public class Kata
{
  public static double[] Multiples(int m, double n)
  {
    double[] d = new double[m];
    for(int i = 0; i < m; i++)
    {
      if(i == 0)
        d[i] += n;
      else
      {
        d[i] = d[i-1] + n;
      }
    }
    return d;
  }
}

答案10:

public class Kata
{
  public static double[] Multiples(int m, double n)
  {
    double[] ans = new double[m];
    for(int i = 1; i <= m; i++)
    {
      ans[i-1] = i*n;
    }
    return ans;
  }
}



  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值