contains(Object o) 的时间复杂度，在对象的 ArrayList 中 [英] Time complexity of contains(Object o), in an ArrayList of Objects

问题描述

正如标题所说，我想知道 contains() 一个ArrayList 是.

解决方案

O(n)

<块引用>

size、isEmpty、get、set、iterator 和listIterator 操作以恒定时间运行.add 操作在分摊的常数时间中运行，即添加 n 个元素需要 O(n) 时间.所有其他操作都在线性时间内运行(粗略地说).与 LinkedList 实现相比，常量因子较低.

http://download.oracle.com/javase/6/docs/api/java/util/ArrayList.html

As the title says, I was wondering what the time complexity of the contains() method of an ArrayList is.

解决方案

O(n)

The size, isEmpty, get, set, iterator, and listIterator operations run in constant time. The add operation runs in amortized constant time, that is, adding n elements requires O(n) time. All of the other operations run in linear time (roughly speaking). The constant factor is low compared to that for the LinkedList implementation.

http://download.oracle.com/javase/6/docs/api/java/util/ArrayList.html

这篇关于contains(Object o) 的时间复杂度，在对象的 ArrayList 中的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！