C#练习题答案: 2的幂【难度:0级】--景越C#经典编程题库,1000道C#基础练习题等你来挑战

2的幂【难度:0级】:

答案1:

using System.Numerics;
using System.Linq;

public class Kata
{
  public static BigInteger[] PowersOfTwo(int n)
  {
    return (from x in Enumerable.Range(0, n+1) select BigInteger.Pow(2, x)).ToArray();
  }
}

答案2:

using System.Linq;
using System.Numerics;

public class Kata
{
  public static BigInteger[] PowersOfTwo(int n)
  {
    return Enumerable.Range(0, n+1).Select(x => BigInteger.Pow(2, x)).ToArray();
  }
}

答案3:

using System.Numerics;
using System.Linq;
public class Kata
{
  public static BigInteger[] PowersOfTwo(int n)
  {
    return Enumerable.Range(0,n+1).Select(x => BigInteger.Pow(2,x)).ToArray(); 
  }
}

答案4:

using System.Linq;
using System.Numerics;

public class Kata
{
  public static BigInteger[] PowersOfTwo(int n)
  {
    return Enumerable.Range(0, n + 1).Select(i => BigInteger.One << i).ToArray();
  }
}

答案5:

using System;
using System.Numerics;

public class Kata
{
  public static BigInteger[] PowersOfTwo(int n)
  {
    BigInteger[] result = new BigInteger[n+1];
    
    for(int i = 0; i < result.Length; i++)
    {
      result[i] = (BigInteger)Math.Pow(2,i);
    }
    
    return result;
  }
}

答案6:

using System.Numerics;
public class Kata
{
  public static BigInteger[] PowersOfTwo(int n)
  {
    var o = new BigInteger[n + 1];
    for (int i = 0; i < o.Length; i++)
        o[i] = i == 0 ? 1 : o[i] = o[i - 1] * 2;
    return o;
  }
}

答案7:

using System;
using System.Numerics;
using System.Linq;

public class Kata
{
  public static BigInteger[] PowersOfTwo(int n)
  {
    return Enumerable.Range(0, n + 1).Select(x => (BigInteger)Math.Pow(2, x)).ToArray();
  }
}

答案8:

using System;
using System.Linq;
using System.Numerics;

public class Kata
{
  public static BigInteger[] PowersOfTwo(int n)
  {
    return Enumerable.Range(0, n + 1).Select(x => (BigInteger)Math.Pow(2, x)).ToArray();
  }
}

答案9:

using System.Numerics;
using System;
using System.Linq;

public class Kata
{
  public static BigInteger[] PowersOfTwo(int n)
  {
    return Enumerable.Range(0,n+1).Select(x=>(BigInteger)Math.Pow(2,x)).ToArray();
  }
}

答案10:

using System.Numerics;
using System;
using System.Linq;
public class Kata
{
  public static BigInteger[] PowersOfTwo(int n)
  {
    return Enumerable.Range(0,n+1).Select(x=>(BigInteger)(Math.Pow(2,x))).ToArray();
  }
}

答案11:

using System.Numerics;
using System.Linq;
using System;

public class Kata
{
  public static BigInteger[] PowersOfTwo(int n) =>  
     Enumerable.Range(0, n+1).Select(power => new BigInteger(Math.Pow(2, power))).ToArray();
  
}

答案12:

using System.Numerics;

public class Kata
{
    public static BigInteger[] PowersOfTwo(int n)
    {
        BigInteger[] powersOfTwo = new BigInteger[n + 1];
        BigInteger currentPower = 1;
        for (int i = 0; i <= n; i++)
        {
            powersOfTwo[i] = currentPower;
            currentPower = currentPower << 1;
        }
        return powersOfTwo;
    }
}

答案13:

using System.Numerics;
using System;
using System.Linq;

public class Kata
{
  public static BigInteger[] PowersOfTwo(int n) =>
      Enumerable.Range(0, n+1).Select(e=>new BigInteger(Math.Pow(2,e))).ToArray();
}

答案14:

using System.Numerics;
using System.Linq;
using System;

public class Kata
{
  public static BigInteger[] PowersOfTwo(int n)
  {
    return Enumerable.Range(0,n+1).Select(cur=>{
                return new BigInteger(Math.Pow(2,cur));
            }).ToArray();
  }
}



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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值