如何实现自己的HashSet包含方法(How implement own HashSet contains method)

 我有HahSet int [9]数组的集合，并且想知道HashSe是否已经包含该数组。 例如 
 
       HashSet<int[]> set = new HashSet<int[]>();
       int[] a=new int[9]{1,2,3,4,5,6,7,8,9};
       set.Add(a);
       int[] a2=new int[9]{1,2,3,4,5,6,7,8,9};
       if(!set.Contains(a2))
          set.Add(a2);
 
 我如何重写或实现自己的Equals方法，使HastSet.Contains行为像Arrays.SequenceEquals？ 

I have HahSet collection of int[9] arrays and want know if HashSe already contains that array. for example
 
       HashSet<int[]> set = new HashSet<int[]>();
       int[] a=new int[9]{1,2,3,4,5,6,7,8,9};
       set.Add(a);
       int[] a2=new int[9]{1,2,3,4,5,6,7,8,9};
       if(!set.Contains(a2))
          set.Add(a2);
 
How can I override or implement own Equals method so that HastSet.Contains would behave like Arrays.SequenceEquals?

原文：https://stackoverflow.com/questions/14799167