C#练习题答案: 简单有趣＃138：相似性【难度：1级】--景越C#经典编程题库,1000道C#基础练习题等你来挑战

最新推荐文章于 2026-01-06 22:13:31 发布

原创最新推荐文章于 2026-01-06 22:13:31 发布 · 186 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#csharp面试题库和答案 #csharp编程练习 #拼图 #游戏

C#编程训练习题答案专栏收录该内容

272 篇文章

订阅专栏

简单有趣#138:相似性【难度:1级】:

答案1:

namespace myjinxin
{
    using System.Linq;
    
    public class Kata
    {
        public double Similarity(int[] a, int[] b){
          return a.Intersect(b).Count() / (double)a.Union(b).Count();
        }
    }
}

答案2:

namespace myjinxin
{
    using System;
    using System.Linq;
    using System.Collections.Generic;
    using System.Text.RegularExpressions;
    public class Kata
    {
public double Similarity(int[] a, int[] b){
  double r=0;
  for(int i=0,j=0,l=0;i<a.Length&amp;&amp;j<b.Length;l++){
    if(a[i]==b[j]){r++;i++;j++;l++;}
    else if(a[i]>b[j]) j++;
    else i++;
  }
  return r/(a.Length+b.Length-r);
} 

    }
}

答案3:

namespace myjinxin
{
    using System.Linq;
    
    public class Kata
    {
        public double Similarity(int[] a, int[] b) {
            return (double)a.Intersect(b).Count() / a.Union(b).Count();
        }
    }
}

答案4:

namespace myjinxin
{
    using System.Linq;
    
    public class Kata
    {
        public double Similarity(int[] a, int[] b) => (double)(a.Intersect(b).Count()) / a.Union(b).Count();
    }
}

答案5:

namespace myjinxin
{
    using System;
    using System.Linq;
    
    public class Kata
    {
        public double Similarity(int[] a, int[] b)
        {
          return a.Intersect(b).Count() / (double) a.Union(b).Count();
        }
    }
}

答案6:

namespace myjinxin
{
    using System;
    using  System.Linq;
    public class Kata
    {
        public double Similarity(int[] a, int[] b){
            var intersection = a.Intersect(b).Count();
            var union = a.Union(b).Count();
            double result = intersection / (double)union;
            return result;
        }
    }
}

答案7:

namespace myjinxin
{
    using System;
    using System.Linq;
    
    public class Kata
    {
        public double Similarity(int[] a, int[] b){
          //coding and coding..
        var aANDb = a.Intersect(b);
        var aORb = a.Union(b);
        int nOR = 0,nAND = 0;
        
        foreach(var v in aANDb)
        {
          ++nAND;
        }
        
        foreach(var v in aORb)
        {
          ++nOR;
        }
        
        double jac = (double)nAND/(double)nOR;
        return jac;
        }
    }
}

答案8:

namespace myjinxin {
    using System.Linq;

    public class Kata {
        public double Similarity( int[] a, int[] b ) {
            var intersect = a.Intersect( b ).Count( );
            var union = a.Union( b ).Count( );
            if ( union == 0 ) {
                return 0;
            }
            return intersect/(double) union;
        }
    }
}

答案9:

using System.Linq;

namespace myjinxin
{
    public class Kata
    {
        public double Similarity(int[] a, int[] b)
        {
            int sameElelmentCount = a.Count(x => b.Any(y => y == x));
            int unionCount = a.Union(b).Count();
            return sameElelmentCount / (double)unionCount;
        }
    }
}

答案10:

namespace myjinxin
{
    using System.Linq;

    public class Kata
    {
        public double Similarity(int[] a, int[] b) => (double)a.Where(b.Contains).Count() / a.Concat(b).Distinct().Count();
    }
}