C#练习题答案: 完成该模式＃6 - 奇梯【难度：1级】--景越C#经典编程题库,1000道C#基础练习题等你来挑战

完成该模式#6 - 奇梯【难度:1级】:

答案1:

using System;
using System.Linq;

public static class Kata
{
  public static string OddLadder(int n)
  {
    if (n <= 0) return String.Empty;
    
    var oddNumbers = Enumerable.Range(1, n).Where(i => i % 2 == 1);
    var lines = oddNumbers.Select(i => String.Join("", Enumerable.Repeat(i.ToString(), i)));
    
    return String.Join(Environment.NewLine, lines);
  }
}​

答案2:

using System;
using System.Linq;

public static class Kata
{
  public static string OddLadder(int n)
  {
    return n <= 0 
    ? string.Empty
    : Enumerable.Range(1,n)
                .Where(num => num % 2 == 1)
                .Select(num => string.Concat(Enumerable.Repeat(num, num)))
                .Aggregate("",(result,current) => result + current + '\n')
                .Trim();
  }
}​

答案3:

using System;

public static class Kata
{
  public static string OddLadder(int n)
  {
    string result = "";
    for(int i = 1; i <= n; i++)
    {
      if(i % 2 != 0)
      {
        if( i != 1){ result += "\n"; }
        for(int j = 0; j < i; j++)
        {
          result += i.ToString();
        }
      }
    }
    return result;
  }
}​

答案4:

using System;
using System.Collections.Generic;
using System.Linq;

public static class Kata
{
  public static string OddLadder(int n)
  {
    if (n <= 0) return string.Empty;
    
    List<string> result = new List<string>();
    for (int i = 1; i <= n; i += 2) {
      string line = string.Join(string.Empty, Enumerable.Repeat(i.ToString(), i));
      result.Add(line);
    }
    
    return string.Join("\n", result);
  }
}​

答案5:

using System;
using System.Text;

public static class Kata
{
  public static string OddLadder(int n)
  {
    var ret = new StringBuilder("");
    for(int num = 1; num <= n; num += 2)
    {
      if(num > 1)
      {
        ret.AppendLine();
      }
      for(int rep = 0; rep < num; rep++)
      {
        ret.Append(num);
      }
    }
    return ret.ToString();
  }
}​

答案6:

using System;
using System.Text;

public static class Kata
{
  public static string OddLadder(int n)
  {
    if (n <= 0){
      return "";
    }
    if (n < 3){
      return "1";
    }
    if (n % 2 == 0){
      n--;
    }
    return string.Concat(
      OddLadder(n - 2),
      "\n",
      new StringBuilder().Insert(0, n.ToString(), n).ToString()
    );
  }
}​

答案7:

using System;
using System.Linq;

public static class Kata
{
  public static string OddLadder(int n)
  {
    if(n <= 0) return "";
    
    return string.Join("\n", Enumerable.Range(1, n)
    .Where(x => x % 2 == 1)
    .Select(x => string.Concat(Enumerable.Repeat(x.ToString(), x))));
  }
}​

答案8:

using System;
using System.Globalization;
using System.Linq;
using System.Text;

public static class Kata
{
    public static string OddLadder(int n)
    {
        if (n <= 0)
        {
            return string.Empty;
        }
        
        return string.Join(
            "\n",
            Enumerable
                .Range(0, (n + 1) / 2)
                .Select(i => Repeat((2 * i + 1).ToString(CultureInfo.InvariantCulture), 2 * i + 1)));
    }

    private static string Repeat(string s, int count)
    {
        return string.Concat(Enumerable.Range(0, count).Select(_ => s));
    }
}
​

答案9:

using System;
using System.Linq;

public static class Kata
{
    public static string OddLadder(int n)
    {
        if (n <= 0)
            return "";

        string result = "1";

        for (int i = 3; i <= n; i += 2)
            result += "\n" + String.Concat(Enumerable.Repeat(i, i));

        return result;
    }
}
​

答案10:

using System;

public static class Kata
{
  public static string OddLadder(int n)
  {
      string s = "";
                for (int i = 1; i <= n; i++)
                {
                    if (i % 2 == 1)
                    {
                        for (int j = 1; j <= i; j++)
                        {
                            s += i.ToString();
                        }
                        if (i < n-1)
                            s += "\n";
                    }
                }
                return n <= 0 ? "" : s;
  }
}​