最大倍【难度: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)
{
return ( ( bound/ divisor) * divisor) ;
}
}
答案4:
public class Kata
{
public static int MaxMultiply ( int divisor, int bound)
{
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)
{
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;
}