C#练习题答案: 最长元音链【难度：1级】--景越C#经典编程题库,1000道C#基础练习题等你来挑战

最新推荐文章于 2024-04-05 21:25:50 发布

goodview andyldm

最新推荐文章于 2024-04-05 21:25:50 发布

阅读量155

点赞数

分类专栏： csharp面试题库和答案文章标签： csharp面试题库和答案 csharp编程练习编程基础上字符串数据类型

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

版权

csharp面试题库和答案专栏收录该内容

266 篇文章 6 订阅

订阅专栏

最长元音链【难度:1级】:

答案1:

using System;
using System.Text.RegularExpressions;
using System.Linq;

public static class Kata
{
  public static int Solve(string str)
  {
    if (str == null)
    {
      throw new ArgumentNullException();
    }
    
    return Regex.Split(str, "[^aeiou]+")
                .Select(e => e.Length)
                .Max();
  }
}

答案2:

using System;
using System.Linq;

public static class Kata
{
  public static int Solve(string str)
        {
            char[] chrs = new char[] { 'a', 'e', 'u', 'i', 'o' };
            var split = str.Split(str.Where(c => !chrs.Contains(c)).ToArray());
            return split.Max(s => s.Length);
        }
}

答案3:

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

public static class Kata
{
    public static int Solve(string str)
    {
        var result = int.MinValue;
        var count = 0;

        foreach (var val in str)
        {
            if ("aeiou".Contains(val.ToString()))
            {
                count++;
                if (count > result)
                {
                    result = count;
                }
            }
            else
            {
                count = 0;
            }
        }

        if (result <= 0)
        {
            return 0;
        }
        return result;
    }
}

答案4:

using System;

public static class Kata
{
  public static int Solve(string str)
  {
    int temp = 0;
    int currMax = 0;
    for(int i = 0; i < str.Length; i++)
    {
      if("aeiou".Contains(str[i]))
      {
        temp++;
      }
      else
      {
        if(temp > currMax)
        {
          currMax = temp;
        }
        temp = 0;
      }
    }
    //we need to check if the longest chain is at the end
    return Math.Max(temp, currMax);
  }
}

答案5:

using System;

public static class Kata {
  public static int Solve(string str) {
    if (str != null) {
      int max = 0;
      int vowelCount = 0;
      foreach (char i in str) {
        if ("aeiou".Contains(i)) {
          vowelCount++;
          if (vowelCount > max) {
            max = vowelCount;
          }
        }
        else {
          vowelCount = 0;
        }
      }
      return max;
    }
    throw new ArgumentNullException();
  }
}

答案6:

using System;
using System.Linq;
using System.Text.RegularExpressions;

public static class Kata {
    public static int Solve( string str ) {
        if ( str == null ) {
            throw new ArgumentNullException( );
        }
        var matches = Regex.Matches( str, "[aeoui]+", RegexOptions.IgnoreCase ).Cast<Match>( ).ToArray( );
        if ( matches.Length == 0 ) {
            return 0;
        }
        return matches.Max( m => m.Value.Length );
    }
}

答案7:

using System;
using System.Text.RegularExpressions;
using System.Linq;

public static class Kata
{
  public static int Solve(string str)
  {
    return Regex.Split(str, "[bcdfghjklmnpqrstvwxyz]").OrderBy(z => -z.Length).ToArray()[0].Length;
  }
}

答案8:

using System.Linq;
using System.Text.RegularExpressions;

public static class Kata
{
  public static int Solve(string str)
  {
    return Regex.Split(str, @"[^aeiou]").Max(x => x.Length);
  }
}

答案9:

using System.Linq;
using System.Text.RegularExpressions;

public static class Kata
{
  public static int Solve(string str)
  {
    return Regex.Matches(str, "[AEIOU]*", RegexOptions.IgnoreCase)
                        .Cast<Match>()
                        .OrderByDescending(m => m.Value.Length)
                        .FirstOrDefault()?.Length ?? 0;
  }
}

答案10:

using System;
using System.Linq;
using System.Text.RegularExpressions;

public static class Kata
{
  public static int Solve(string str)
    => Regex.Matches(str, "[aeiou]+").Cast<Match>().Select(x => x.Length).DefaultIfEmpty().Max();
}