除非你真的关心性能，我的意思是，“你为什么使用。net而不是c++ ?”你应该坚持使用List<>。它更容易维护，并为您在幕后完成调整数组大小的所有繁琐工作。(如果有必要，List<>在选择数组大小方面非常聪明，所以通常不需要这样做。)

因为没有人提到:在c#中，数组是一个列表。MyClass[]和List<MyClass>都实现了IList<MyClass>。(例如void Foo(IList<int> Foo)可以像Foo(new[]{1,2,3})或Foo(new List<int>{1,2,3})一样调用)

因此，如果你正在编写一个接受List<MyClass>作为参数的方法，但只使用功能的子集，你可能想声明为IList<MyClass>，以方便调用者。

细节:

为什么数组实现IList? 如何在c#数组部分实现IList<T>?

它完全取决于需要数据结构的上下文。例如，如果您正在创建供其他函数或服务使用的项，则使用List是完成该任务的最佳方式。

现在，如果你有一个项目列表，你只是想在网页上显示它们，数组是你需要使用的容器。

填充列表比填充数组更容易。对于数组，您需要知道数据的确切长度，但对于列表，数据大小可以是任何大小。你可以把一个列表转换成一个数组。

List<URLDTO> urls = new List<URLDTO>();

urls.Add(new URLDTO() {
    key = "wiki",
    url = "https://...",
});

urls.Add(new URLDTO()
{
    key = "url",
    url = "http://...",
});

urls.Add(new URLDTO()
{
    key = "dir",
    url = "https://...",
});

// convert a list into an array: URLDTO[]
return urls.ToArray();

除非你真的关心性能，我的意思是，“你为什么使用。net而不是c++ ?”你应该坚持使用List<>。它更容易维护，并为您在幕后完成调整数组大小的所有繁琐工作。(如果有必要，List<>在选择数组大小方面非常聪明，所以通常不需要这样做。)

Another situation not yet mentioned is when one will have a large number of items, each of which consists of a fixed bunch of related-but-independent variables stuck together (e.g. the coordinates of a point, or the vertices of a 3d triangle). An array of exposed-field structures will allow the its elements to be efficiently modified "in place"--something which is not possible with any other collection type. Because an array of structures holds its elements consecutively in RAM, sequential accesses to array elements can be very fast. In situations where code will need to make many sequential passes through an array, an array of structures may outperform an array or other collection of class object references by a factor of 2:1; further, the ability to update elements in place may allow an array of structures to outperform any other kind of collection of structures.

Although arrays are not resizable, it is not difficult to have code store an array reference along with the number of elements that are in use, and replace the array with a larger one as required. Alternatively, one could easily write code for a type which behaved much like a List<T> but exposed its backing store, thus allowing one to say either MyPoints.Add(nextPoint); or MyPoints.Items[23].X += 5;. Note that the latter would not necessarily throw an exception if code tried to access beyond the end of the list, but usage would otherwise be conceptually quite similar to List<T>.