C#练习题答案: 最大倍【难度:1级】--景越C#经典编程题库,1000道C#基础练习题等你来挑战

最大倍【难度:1级】:

答案1:

public class Kata
{
    public static int MaxMultiply(int divisor, int bound)
    {
        return bound / divisor * divisor;
    }
}

答案2:

public class Kata
{
    public static int MaxMultiply(int divisor, int bound)
    {        
        return (bound / divisor) * divisor;
    }
}

答案3:

public class Kata
{
    public static int MaxMultiply(int divisor, int bound)
    {
        //Do some magic
        return ((bound/divisor)*divisor);
    }
}

答案4:

public class Kata
{
    public static int MaxMultiply(int divisor, int bound)
    {
        //Do some magic
        return (bound/divisor)* divisor;
    }
}

答案5:

public class Kata
{
    public static int MaxMultiply(int divisor, int bound) => bound - (bound % divisor);
}

答案6:

public class Kata
{
    public static int MaxMultiply(int divisor, int bound) => 
    (bound%divisor==0) ? bound:(bound/divisor)*divisor;
}

答案7:

using System;
using System.Collections.Generic;
using System.Linq;
public class Kata
{
    public static int MaxMultiply(int divisor, int bound)
    {
       List<int> l= new List<int>();
       
       for(int i =1; i<=bound; i++)
       {
           if(i % divisor==0)
            l.Add(i);
       }
       
       return l.Max();
    }
}

答案8:

public class Kata
{
    public static int MaxMultiply(int divisor, int bound)
    {
      return bound-bound%divisor;
    }
}

答案9:

public class Kata
{
    public static int MaxMultiply(int divisor, int bound)
    {
        //Do some magic
        return bound-bound%divisor;
    }
}

答案10:

public class Kata
{
    public static int MaxMultiply(int divisor, int bound)
    {
        return bound-(bound%divisor);
    }
}

答案11:

public class Kata
{
    public static int MaxMultiply(int divisor, int bound)
    {
        int N = bound;
        while(true)
        {
            if(N % divisor == 0)
            {
                return N;
            }
            N--;
        }
    }
}

答案12:

public class Kata
{
    public static int MaxMultiply(int divisor, int bound)
    {
        while (true)
        {
          if (!((float)bound / divisor).ToString().Contains("."))
          {
            break;
          }
          bound--;
        }
        
        return bound;
    }
}

答案13:

public class Kata
{
    public static int MaxMultiply(int divisor, int bound)
    {
      int i = bound+1;
    do
      {
        i--;
      }
    while(i>0 &amp;&amp; i % divisor !=0);
    return i;
    }
}

答案14:

public class Kata
{
        public static int MaxMultiply(int divisor, int bound)
        {
            int result = bound;
            while (!(result % divisor == 0 &amp;&amp; result <= bound))
                result--;
            return result;
        }
}

答案15:

public class Kata
{
    public static int MaxMultiply(int divisor, int bound) => 
      bound % divisor == 0 ? bound : bound - bound % divisor;
}



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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值