C#练习题答案: 正则表达式计数小写字母【难度:0级】--景越C#经典编程题库,1000道C#基础练习题等你来挑战

正则表达式计数小写字母【难度:0级】:

答案1:

using System.Linq;

public class Kata
{
  public static int LowercaseCountCheck(string s)
  {
    return s.Count(char.IsLower);
  }
}

答案2:

using System.Text.RegularExpressions;
public class Kata
{
  public static int LowercaseCountCheck(string s)
  {
    // your code goes here ...
    return Regex.Matches(s, "[a-z]").Count;
  }
}

答案3:

using System.Text.RegularExpressions;

public class Kata
{
  public static int LowercaseCountCheck(string s)
  {
    return Regex.Matches(s, "[a-z]").Count;
  }
}

答案4:

using System.Text.RegularExpressions;
public class Kata
{
  public static int LowercaseCountCheck(string s)
  {
     
     return  Regex.Matches(s,@"[a-z]").Count;
    
    
  }
}

答案5:

using System.Text.RegularExpressions;

public class Kata
{
  public static int LowercaseCountCheck(string s)
  {
    return Regex.Matches(s, @"([a-z])").Count;
  }
}

答案6:

using System;
using System.Linq;
public class Kata
{
  public static int LowercaseCountCheck(string s) => s.ToCharArray().Where(x => Char.IsLower(x)).Count();
}

答案7:

using System;

public class Kata
{
    public static int LowercaseCountCheck(string s)
    {
        var result = "";

        foreach (var val in s)
        {
            if (char.IsLower(val))
            {
                result += val;
            }
        }

        return result.Length;
    }
}

答案8:

using System.Linq;

public class Kata
{
  public static int LowercaseCountCheck(string s) => s.Count(c => char.IsLower(c));
}

答案9:

using System.Collections.Generic;
using System.Linq;
public class Kata
{
  public static int LowercaseCountCheck(string s) => (new List<char>(s)).Count(c => char.IsLower(c));
}

答案10:

using System.Text.RegularExpressions;
public class Kata
{
  public static int LowercaseCountCheck(string s)
  {
    // your code goes here ...
    Regex regex = new Regex(@"([a-z])");
     
    return regex.Matches(s).Count;
  }
}

答案11:

public class Kata
{
  public static int LowercaseCountCheck(string s)
  {
    int c = 0;
    for (int i = 0; i < s.Length; i++) {
      if (s[i] >= 'a' &amp;&amp; s[i] <= 'z')
      {
        c++;
       }
    }
    return c;
  }
}

答案12:

using System.Text.RegularExpressions;

public class Kata
{
  public static int LowercaseCountCheck(string Input)
  {
    return new Regex("[^a-z]").Replace(Input, "").Length;
  }
}



评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值