blocks|key|899462|text|使用标准库中的std::vector+class。|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|899463|entityMap|0|LINK|mutability|MUTABLE|url|http://en.cppreference.com/w/cpp/container/vector^0|7|B|7|H|0|0^^$0|@$1|2|3|4|5|6|7|N|8|@$9|O|A|P|B|C]]|D|@$9|Q|A|R|1|S]]|E|$]]|$1|F|3|-4|5|6|7|T|8|@]|D|@]|E|$]]]|G|$H|$5|I|J|K|E|$L|M]]]]

Use the <a href="http://en.cppreference.com/w/cpp/container/vector" rel="noreferrer"><code>std::vector</code> class</a> from the standard library.

blocks|key|899518|text|另外几点是在这里重新使用vector。|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|899519|与Java语言中的ArrayList和Array不同，您不需要做任何特殊的事情来将vector视为一个数组-+C%2B%2B中的底层存储被保证是连续的和高效的可索引的。|899520|与ArrayList不同，vector可以有效地保存原始类型，而无需将其封装为完整的对象。|899521|从vector中删除项目时，请注意必须将已删除项目上方的项目下移以保留连续的存储空间。对于大型容器来说，这可能会变得很昂贵。|899522|如果您将复杂对象存储在vector中，请确保它们的复制构造函数和赋值操作符是有效的。在幕后，C%2B%2B+STL在容器管理过程中使用这些。|899523|关于预先存储reserve()的建议(即，在向量构造或初始化时)，以便在以后的扩展中最小化内存重新分配，从Java到C%2B%2B。|899524|entityMap^0|C|6|0|9|9|J|5|15|6|0|1|9|D|6|0|1|6|0|B|6|0|6|9|0^^$0|@$1|2|3|4|5|6|7|R|8|@$9|S|A|T|B|C]]|D|@]|E|$]]|$1|F|3|G|5|6|7|U|8|@$9|V|A|W|B|C]|$9|X|A|Y|B|C]|$9|Z|A|10|B|C]]|D|@]|E|$]]|$1|H|3|I|5|6|7|11|8|@$9|12|A|13|B|C]|$9|14|A|15|B|C]]|D|@]|E|$]]|$1|J|3|K|5|6|7|16|8|@$9|17|A|18|B|C]]|D|@]|E|$]]|$1|L|3|M|5|6|7|19|8|@$9|1A|A|1B|B|C]]|D|@]|E|$]]|$1|N|3|O|5|6|7|1C|8|@$9|1D|A|1E|B|C]]|D|@]|E|$]]|$1|P|3|-4|5|6|7|1F|8|@]|D|@]|E|$]]]|Q|$]]

A couple of additional points re use of <code>vector</code> here.

Unlike <code>ArrayList</code> and <code>Array</code> in Java, you don't need to do anything special to treat a <code>vector</code> as an array - the underlying storage in C++ is guaranteed to be contiguous and efficiently indexable.

Unlike <code>ArrayList</code>, a <code>vector</code> can efficiently hold primitive types without encapsulation as a full-fledged object.

When removing items from a <code>vector</code>, be aware that the items above the removed item have to be moved down to preserve contiguous storage. This can get expensive for large containers. 

Make sure if you store complex objects in the <code>vector</code> that their copy constructor and assignment operators are efficient. Under the covers, C++ STL uses these during container housekeeping.

Advice about <code>reserve()</code>ing storage upfront (ie. at vector construction or initialilzation time) to minimize memory reallocation on later extension carries over from Java to C++.

blocks|key|1114291|text|和其他答案一样，最接近的答案是std::vector。|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|1114292|但有一件重要的事情需要考虑，那就是空间复杂性。|1114293|当当前容量已满时，C%2B%2B向量具有依赖于编译器的计算。当容量满时，一些编译器以指数方式增加向量容量，而一些编译器则以松散的指数方式增加向量容量。|1114294|对于Java+arraylist，当容量已满时，标准没有指定确切的详细信息来重新计算容量。有些人的粗略计算是150%25加1。但不确定这是否是准确的计算。|1114295|entityMap^0|F|B|0|0|0|0^^$0|@$1|2|3|4|5|6|7|N|8|@$9|O|A|P|B|C]]|D|@]|E|$]]|$1|F|3|G|5|6|7|Q|8|@]|D|@]|E|$]]|$1|H|3|I|5|6|7|R|8|@]|D|@]|E|$]]|$1|J|3|K|5|6|7|S|8|@]|D|@]|E|$]]|$1|L|3|-4|5|6|7|T|8|@]|D|@]|E|$]]]|M|$]]

Like other answers the closest one is <code>std::vector</code>.
But there is one important thing to consider, space complexity.
The C++ vector has compiler dependent calculation when current capacity is full. When capacity is full some compilers grow the vector capacity exponentially and some loosely exponential.
For Java arraylist, there are no exact details specified by standards for recalculating the capacity when it is full. Some have a rough calculation of 150% plus one. But not sure if that is the exact calculation.

Just getting back into using C++ and trying to convert a simple Java program I wrote recently. 

What's the preferred equivalent to the Java ArrayList in C++?

What's the C++ version of Java's ArrayList

对象存储

编译器

容器

Java

只是重新开始使用C++，并尝试转换我最近编写的一个简单的Java程序。C++中的Java ArrayList的首选等价物是什么？

问Java的ArrayList的C++版本是什么
EN

社区

活动

资源

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问Java的ArrayList的C++版本是什么EN

社区

活动

资源

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问Java的ArrayList的C++版本是什么
EN