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

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();

Lists in .NET are wrappers over arrays, and use an array internally. The time complexity of operations on lists is the same as would be with arrays, however there is a little more overhead with all the added functionality / ease of use of lists (such as automatic resizing and the methods that come with the list class). Pretty much, I would recommend using lists in all cases unless there is a compelling reason not to do so, such as if you need to write extremely optimized code, or are working with other code that is built around arrays.

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>.

在现实中，很少需要使用数组。当您想添加/删除数据时，一定要使用List<T>，因为调整数组的大小是非常昂贵的。如果您知道数据是固定长度的，并且由于某些非常特定的原因(在基准测试之后)想要进行微观优化，那么数组可能会很有用。

List<T>提供了比数组更多的功能(尽管LINQ稍微均衡了一点)，并且几乎总是正确的选择。当然，除了参数参数。- p;

当counter - List<T时，>是一维的;比如你已经有了int[，]或string[，，]这样的矩形数组，但是在对象模型中还有其他方法来建模这样的数据(如果你需要的话)。

参见:

如何/何时在c#.net中放弃使用数组? 数组，重点是什么?

也就是说，我在我的protobuf-net项目中大量使用数组;完全为了性能:

它做了很多位移动，所以字节[]对于编码非常重要; 我使用一个本地滚动字节[]缓冲区，我在发送到底层流(和v.v v.)之前填充;比BufferedStream等更快; 它在内部使用基于数组的对象模型(Foo[]而不是List<Foo>)，因为大小一旦构建就固定了，并且需要非常快。

但这绝对是个例外;对于一般业务线处理，List<T>每次都胜出。

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

当集合本身的不可变性是客户端和提供者代码之间契约的一部分时(不一定是集合中项目的不可变性)以及当IEnumerable不合适时，应该优先使用数组而不是List。

例如,

var str = "This is a string";
var strChars = str.ToCharArray();  // returns array

很明显，对"strChars"的修改不会改变原始的"str"对象，无论实现级是否了解"str"的底层类型。

但是假设

var str = "This is a string";
var strChars = str.ToCharList();  // returns List<char>
strChars.Insert(0, 'X');

在这种情况下，仅仅从代码片段中还不清楚insert方法是否会改变原始的“str”对象。它需要String的实现级知识来做出判断，这打破了契约式设计方法。在String的情况下，这不是一个大问题，但在几乎所有其他情况下，这可能是一个大问题。将List设置为只读确实有帮助，但会导致运行时错误，而不是编译时错误。