我可以使用 LINQ 来比较两个 arrays 的范围吗？

Question

I can roll a method, pseudo:

bool Compare(IList left, int lIndex, IList right, int rIndex, int num)
{
  for(int i=0;i<num;++i)
  {
   if(left[lIndex+i] != right[rIndex+i])
   {
    return false;
   }
  }
  return true;
} 

So given L =[1,2,3,4,5,6,7,8] and R = [5,6,7,8,9] : Compare(L,5,R,1,3) == true

I feel I should be able to do a simple LINQ version but I am not sure how to handle the indexing. Can it be written as a trivial LINQ/lambda... otherwise I'll pull this out as a utility method.

---

By the way there is a question with a very similar title but it is asking a different thing: https://stackoverflow.com/questions/33812323/compare-two-arrays-using-linq

Answer 1

You can Skip , Take , and SequenceEqual :

return left.Skip(lIndex).Take(num).SequenceEqual(
        right.Skip(rIndex).Take(num))

Note that you should make your Compare method generic and use the generic IList<T> instead.

Answer 2

you can try this

    int num = 3,lIndex =5,rIndex =1;

    var L = (new List<int>(){1,2,3,4,5,6,7,8}).Skip(lIndex).Take(num).ToList();
    var R = (new List<int>(){5,6,7,8,9}).Skip(rIndex).Take(num).ToList();

    var result = L.Count() == R.Count() && !R.Except(L).Any() && !L.Except(R).Any() && string.Join(",",L).Equals(string.Join(",",R));