C#练习题答案: 只有一个可以说是魔法#5-真的吗?【难度:1级】--景越C#经典编程题库,1000道C#基础练习题等你来挑战

只有一个可以说是魔法#5-真的吗?【难度:1级】:

答案1:

using System;
using System.Linq;

public class Kata
{
  public static bool One(int[] arr, Func<int, bool> fun)
  {
    return arr.Count(fun) == 1;
  }
}

答案2:

using System;
using System.Linq;

public class Kata
{
  public static bool One(int[] arr, Func<int, bool> fun)
  {
    return arr.Where(fun).Count() == 1;
  }
}

答案3:

using System;
using System.Linq;

public class Kata
{
  public static bool One(int[] arr, Func<int, bool> fun)
  {
    // One-liner
    // return arr.Count(i => fun(i)) == 1;
    
    // Stops calling func and returns early if we know we've got more than one
    int count = 0;
    for (int i = 0; i < arr.Length &amp;&amp; count < 2; ++i)
    {
      if (fun(arr[i])) { ++count; }
    }
    return count == 1;
  }
}

答案4:

using System;
using System.Linq;

public class Kata
{
  public static bool One(int[] arr, Func<int, bool> fun) => arr.Count(x => fun(x)) == 1;
}

答案5:

using System;
using System.Linq;

public class Kata
{
  public static bool One(int[] arr, Func<int, bool> fun)
  {
    return arr.Select(x => fun(x)).Where(x => x == true).Count() == 1;
  }
}

答案6:

using System;
using System.Linq;

public class Kata
{
  public static bool One(int[] arr, Func<int, bool> fun)
  {
    int count = arr.Count(fun);
    
    return count == 1 ? true : false;
  }
}

答案7:

using System;

public class Kata
{
  public static bool One(int[] arr, Func<int, bool> fun)
  {
    int trues = 0;
    foreach (int i in arr) {
      if (fun(i)) {
        trues++;
      }
    }
    return trues == 1;
  }
}

答案8:

using System;
using System.Linq;
public class Kata
{
  public static bool One(int[] arr, Func<int, bool> fun)
  {
    return (arr.Where(x => fun(x) == true)).Count() == 1;
  }
}

答案9:

using System;
using System.Linq;

public class Kata
{
  public static bool One(int[] arr, Func<int, bool> fun)
  {
    return arr.Select(fun).ToArray().Count(i => i == true) == 1;
  }
}

答案10:

using System;

public class Kata
{
  public static bool One(int[] arr, Func<int, bool> fun)
  {
    bool found = false;
    for (int i = 0; i < arr.Length; i++)
    {
      if (fun(arr[i])) {
        if (found) return false;
        found = true;
      }
    }
    return found;
  }
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值