从两个数组中比较/排序项目的最有效方法是什么？

I have a question about efficient implementation. Lets say I have two arrays:

我有一个关于有效实施的问题。可以说我有两个数组:

One array is all possible items in a house: Table, Chair, TV, Fireplace, Bed

The other is an array of items in a particular house: Table, TV, Bed

I also have two list boxes:

我还有两个列表框:

1. listbox for items in the house - the "HAS" list box
2. listbox items not in the house - the "NEEDS" list box

I need to list the items already in the house in the "HAS" list box as well as the items that are NOT in the house in the "NEEDS" list box. It seems to me that nested "For each" loops would be a start to solving this problem but I am not exactly sure which case needs to be nested. What is the most efficient way to accomplish a task like this?

我需要在“HAS”列表框中列出房子中已有的项目以及“NEEDS”列表框中不在房屋中的项目。在我看来,嵌套的“For each”循环将是解决这个问题的开始,但我不确定哪种情况需要嵌套。完成这样的任务的最有效方法是什么?

2 个解决方案

#1

var allItems = (new [] {"Table", "Chair", "TV", "Fireplace", "Bed"});
var hasItems = (new [] {"Table", "Chair"});

var hasList = hasItems.ToList();
var needsList = allItems.Except(hasItems).ToList();

#2

var allList = (new [] {"Table", "Chair", "TV", "Fireplace", "Bed"}).ToList();
var hasList = (new [] {"Table", "Chair"}).ToList();

var hasSet = new HashSet<string>(hasList);
var needsList = allList.Where(i => !hasList.Contains(i)).ToList();

That's ~ the fastest solution (at least, in big O notation).

这是最快的解决方案(至少在大O表示法中)。