C#练习题答案: 计数像一个孩子。【难度：1级】--景越C#经典编程题库,1000道C#基础练习题等你来挑战

本文链接：https://blog.csdn.net/weixin_45444821/article/details/102695905

计数像一个孩子.【难度:1级】:

答案1:

using System.Linq;
public static class Kata
    {
        public static int[] KidoCount(int n) => Enumerable.Range(1, n).Where(x => x % 2 != 0).ToArray();
    }

答案2:

using System;
using System.Linq;

public static class Kata {

    public static int[] KidoCount(int n) => n == 0 ? new int[0] : Enumerable.Range(1,n).ToArray().Where(x => x % 2 == 1).ToArray();


}

答案3:

public static class Kata {

    public static int[] KidoCount(int n) {
        int[] ans = new int[(n + 1) / 2];
        for(int i = 1; i <= n; i += 2)
        {
            ans[(i - 1) / 2] = i;
        }
        return ans;
    }

}

答案4:

using System.Collections.Generic;

public static class Kata {

    public static int[] KidoCount(int n) {
        List<int> numbers = new List<int>();
        
        for(int i = 1; i<=n; i++){
          if(i%2!=0){
            numbers.Add(i);
          }
        }
        
        return numbers.ToArray();
    }

}

答案5:

using System;
using System.Collections.Generic;

public static class Kata {

    public static int[] KidoCount(int n) {
      List<int> odds = new List<int>();
      
      for (int i = 0; i <=  n; i++) {
        if (i % 2 != 0)
          odds.Add(i);
      }
          
      return odds.ToArray();
    }

}

答案6:

public static class Kata 
{
    public static int[] KidoCount(int n) 
    {
        int[] arr = new int[(n+1)/2];
        for (int i = 1, j = 0; i<=n; i+=2, ++j)
            arr[j] = i;
        
        return arr;
    }
}

答案7:

using System.Linq;

public static class Kata {

    public static int[] KidoCount(int n) {
        return Enumerable.Range(0, (n + 1) / 2).Select(x => x * 2 + 1).ToArray();
    }

}

答案8:

using System.Linq;

public static class Kata {

    public static int[] KidoCount(int n) {
        return Enumerable.Range(1, n).Where(x => x % 2 != 0).ToArray();
    }

}

答案9:

using System.Collections.Generic;

public static class Kata {

    public static int[] KidoCount(int n) {
        List<int> kid = new List<int>();
        for(int i = 1; i <= n; i+=2){
          kid.Add(i);
        }
        
        return kid.ToArray();
    }

}

答案10:

public static class Kata {

    public static int[] KidoCount(int n) {
        var count = new int[(n+1) / 2];
        for (var i = 0; i < count.Length; i++)
            count[i] = i * 2 + 1;
        return count;
    }

}