C#の演習は答える:バッタ - 合計[難易度:0] - あなたが挑戦するのを待っている、C#プログラミング古典的なQ&Aを見る1000回のC#の基本的な演習を

免責事項:この記事はブロガーオリジナル記事です、続くBY-SAのCC 4.0を著作権契約、複製、元のソースのリンクと、この文を添付してください。
このリンク: https://blog.csdn.net/weixin_45444821/article/details/102750620

バッタ - 合計[難易度:0]:

回答1:

using System;

public static class Kata 
{
    public static int summation(int num)
    {
      return num*(num+1)/2;
    }
}

回答2:

public static class Kata 
{
    public static int summation(int num)
    {
        return num*(num + 1)/2;
    }
}

回答3:

using System;

public static class Kata 
{
    public static int summation(int num)
    {
      return (num*(num+1))/2;
    }
}

回答4:

using System;

public static class Kata 
{
    public static int summation(int num)
    {
      //Code here
      return (num * (num+1)) / 2;
    }
}

回答5:

using System;

public static class Kata 
{
    public static int summation(int num)
    {
      //Code here
      return num*(num+1)/2;
    }
}

A6:

using System;

public static class Kata 
{
    public static int summation(int num)
    {
 
      return (num * (num+1) /2);
      
    }
}

A7:

using System;

public static class Kata 
{
    public static int summation(int num)
    {
      //Code here
      return ((num * (num + 1))/2);
    }
}

A8:

using System;

public static class Kata 
{
    public static int summation(int num)
    {
      return ((num * (num + 1))/2);
    }
}

A9:

using System;

public static class Kata 
{
    public static int summation(int num)
    {
      return (num*(num + 1))/2;
      //Code here
    }
}

10回答:

using System;
using System.Linq;

public static class Kata 
{
    public static int summation(int num)
    {
      return Enumerable.Range(1, num).Sum();
    }
}

ソリューション11:

using System;
using System.Linq;

public static class Kata 
{
    public static int summation(int num)
    {
      //Code here
      return Enumerable.Range(1, num).Sum();
    }
}

答え12:

using System.Linq;

public static class Kata 
{
    public static int summation(int num)
    {
      return Enumerable.Range(1, num).ToArray().Sum();
    }
}

ソリューション13:

using System.Linq;

public static class Kata 
{
    public static int summation(int num)
    {
      //Code here
      return Enumerable.Range(1, num).ToArray().Sum();
    }
}

答え14:

using System;

public static class Kata 
{
    public static int summation(int num)
    {
      var result = 0;
  
      for (var i = 0; i <= num; i++)
      {
          result += i;
      }
  
      return result;
    }
}

答え15:

using System;

public static class Kata 
{
    public static int summation(int num)
    {
      return (1 + num) * num / 2;
    }
}

答え16:

public static class Kata
{
    public static int summation(int num)
    {
        return (1 + num) * num / 2;
    }
}

答え17:

using System;

public static class Kata 
{
    public static int summation(int num)
    {
      //Code here
      return (1+num)*num/2;
    }
}

答え18:

using System;

public static class Kata 
{
    public static int summation(int num)
    {
      int x = 0;
      for(int counter=0 ; counter <= num ; counter++) 
        {
        x = x + counter;
        }
    return x;
    }
}

答え19:

using System;

public static class Kata 
{
    public static int summation(int num)
    {
      if ( num == 1 ) {
        return num;
      } else {
        return num + summation (num - 1);
      }
    }
}

答え20:

using System;

public static class Kata 
{
    public static int summation(int n)
    {
      return n * (n + 1) / 2;
    }
}

答え21:

public static class Kata  {
  public static int summation(int n) {
    return n * (n + 1) / 2;
  }
}

答え22:

using System;

public static class Kata 
{
    public static int summation(int n)
    {
      return (n * (n + 1)) / 2;
    }
}

答え23:

using System;

public static class Kata 
{
    public static int summation(int num) => num != 1 ? num + summation(num-1) : 1;
}

答え24:

using System;

public static class Kata 
{
    public static int summation(int num)
    {
         int[] arrlist = new int[num];
            int sum = 0;
            for (int n = 0; n <= arrlist.Length; n++)
            {
                sum += n;
            }
            return sum;
    }
}



おすすめ

転載: blog.csdn.net/weixin_45444821/article/details/102750620