首页
看之前建议先看这一篇
首页：JAVA基础之容器汇总
ArraryList
ArrayList实现了List接口，ArrayList底层是用数组实现的
优缺点
优点：查询效率高
缺点：增删效率低，线程不安全
没学过多线程的话就不要纠结啥是线程安全和不安全了，为啥是线程不安全，它底层实现时没使用synchronize关键字锁住呗。
代码实现
学编程不敲代码别跟我说你在学编程：
public class ArraryList {
public static void main(String[] args) {
//实例化一个ArrayList，使用上转型对象，上转型和下转型还不知道的话自行百度
List<String> list = new ArrayList<>();
//添加元素
list.add("a");
list.add("b");
list.add("c");
//指定下标添加元素
list.add(2,"d");
//注意这里添加后的位置，使用add后是上次使用add后的下标添加
//所以一般不建议在循环里面删除或者添加元素
list.add(3,"a");
//遍历list
for(int i = 0; i < list.size(); i++){
System.out.println(list.get(i));
}
//删除元素
//通过下标删除
String rev = list.remove(1);
System.out.println("通过下标删除的返回值rev = " + rev);
//通过元素删除，但是只能删除第一个
boolean flag = list.remove("a");
System.out.println("通过元素删除返回的值flag = " + flag);
System.out.println("1、-----------------------------------");
for(String str : list){
System.out.println(str);
}
System.out.println("2、-----------------------------------");
list.add(0,"a");
for(String str : list){
System.out.println(str);
}
int index1 = list.indexOf("a");
System.out.println("indexOf查找a的index1 = " + index1);
int index2 = list.lastIndexOf("a");
System.out.println("lastIndexOf查找a的index2 = " + index2);
//再创建一个实例
List<String> list2 = new ArrayList<>();
list2.add("d");
list2.add("e");
list2.add("f");
//求list与list2的并集,只是单纯的添加到一起，没有去重
list.addAll(list2);
System.out.println("3、-----------------------------------");
for(String str : list){
System.out.println(str);
}
//带有下标的方法addAll是用来表示从哪里开始添加，默认是在末尾添加
list.addAll(2,list2);
System.out.println("4、-----------------------------------");
for(String str : list){
System.out.println(str);
}
//交集
list.retainAll(list2);
System.out.println("5、-----------------------------------");
for(String str : list){
System.out.println(str);
}
//清空
list.clear();
System.out.println("6、-----------------------------------");
for(String str : list){
System.out.println(str);
}
//差集
list.add("a");
list.add("b");
list.add("d");
list.add("f");
list.removeAll(list2);
System.out.println("7、-----------------------------------");
for(String str : list){
System.out.println(str);
}
//判断是否包含某个元素
System.out.println("8、-----------------------------------");
for(String str : list){
System.out.println(str);
}
boolean res = list.contains("a");
System.out.println("list是否包含a : " + res);
res = list.contains("z");
System.out.println("list是否包含z :" + res);
res = list.containsAll(list2);
System.out.println("list是否包含list2的所有内容 = " + res);
System.out.println("-----------------加几个元素-----------");
list.add("d");
list.add("e");
list.add("f");
res = list.containsAll(list2);
System.out.println("list是否包含list2的所有内容 = " + res);
System.out.println("9、-----------------------------------");
//转成泛型数组
String[] arr = list.toArray(new String[list.size()]);
//遍历数组
for(int i = 0; i < arr.length; i++){
System.out.println(arr[i]);
}
}
}
结果：
"C:\Program Files\Java\jdk1.8.0_144\bin\java.exe"
a
b
d
a
c
通过下标删除的返回值rev = b
通过元素删除返回的值flag = true
1、-----------------------------------
d
a
c
2、-----------------------------------
a
d
a
c
indexOf查找a的index1 = 0
lastIndexOf查找a的index2 = 2
3、-----------------------------------
a
d
a
c
d
e
f
4、-----------------------------------
a
d
d
e
f
a
c
d
e
f
5、-----------------------------------
d
d
e
f
d
e
f
6、-----------------------------------
7、-----------------------------------
a
b
8、-----------------------------------
a
b
list是否包含a : true
list是否包含z :false
list是否包含list2的所有内容 = false
-----------------加几个元素-----------
list是否包含list2的所有内容 = true
9、-----------------------------------
a
b
d
e
f
Process finished with exit code 0
感觉代码注释写的挺清楚的了，就不解释了，建议自己动手敲一遍。
底层源码
你觉得我会不会讲，哈哈(ಡωಡ)hiahiahia
public class ArrayList<E> extends AbstractList<E>
implements List<E>, RandomAccess, Cloneable, java.io.Serializable
{
private static final long serialVersionUID = 8683452581122892189L;
/**
* Default initial capacity.
*/
private static final int DEFAULT_CAPACITY = 10;
/**
* Shared empty array instance used for empty instances.
*/
private static final Object[] EMPTY_ELEMENTDATA = {};
/**
* Shared empty array instance used for default sized empty instances. We
* distinguish this from EMPTY_ELEMENTDATA to know how much to inflate when
* first element is added.
*/
private static final Object[] DEFAULTCAPACITY_EMPTY_ELEMENTDATA = {};
/**
* The array buffer into which the elements of the ArrayList are stored.
* The capacity of the ArrayList is the length of this array buffer. Any
* empty ArrayList with elementData == DEFAULTCAPACITY_EMPTY_ELEMENTDATA
* will be expanded to DEFAULT_CAPACITY when the first element is added.
*/
transient Object[] elementData; // non-private to simplify nested class access
/**
* The size of the ArrayList (the number of elements it contains).
*
* @serial
*/
private int size;
/**
* Constructs an empty list with the specified initial capacity.
*
* @param initialCapacity the initial capacity of the list
* @throws IllegalArgumentException if the specified initial capacity
* is negative
*/
public ArrayList(int initialCapacity) {
if (initialCapacity > 0) {
this.elementData = new Object[initialCapacity];
} else if (initialCapacity == 0) {
this.elementData = EMPTY_ELEMENTDATA;
} else {
throw new IllegalArgumentException("Illegal Capacity: "+
initialCapacity);
}
}
/**
* Constructs an empty list with an initial capacity of ten.
*/
public ArrayList() {
this.elementData = DEFAULTCAPACITY_EMPTY_ELEMENTDATA;
}
/**
* Constructs a list containing the elements of the specified
* collection, in the order they are returned by the collection's
* iterator.
*
* @param c the collection whose elements are to be placed into this list
* @throws NullPointerException if the specified collection is null
*/
public ArrayList(Collection<? extends E> c) {
elementData = c.toArray();
if ((size = elementData.length) != 0) {
// c.toArray might (incorrectly) not return Object[] (see 6260652)
if (elementData.getClass() != Object[].class)
elementData = Arrays.copyOf(elementData, size, Object[].class);
} else {
// replace with empty array.
this.elementData = EMPTY_ELEMENTDATA;
}
}
/**
* Trims the capacity of this <tt>ArrayList</tt> instance to be the
* list's current size. An application can use this operation to minimize
* the storage of an <tt>ArrayList</tt> instance.
*/
public void trimToSize() {
modCount++;
if (size < elementData.length) {
elementData = (size == 0)
? EMPTY_ELEMENTDATA
: Arrays.copyOf(elementData, size);
}
}
/**
* Increases the capacity of this <tt>ArrayList</tt> instance, if
* necessary, to ensure that it can hold at least the number of elements
* specified by the minimum capacity argument.
*
* @param minCapacity the desired minimum capacity
*/
public void ensureCapacity(int minCapacity) {
int minExpand = (elementData != DEFAULTCAPACITY_EMPTY_ELEMENTDATA)
// any size if not default element table
? 0
// larger than default for default empty table. It's already
// supposed to be at default size.
: DEFAULT_CAPACITY;
if (minCapacity > minExpand) {
ensureExplicitCapacity(minCapacity);
}
}
private void ensureCapacityInternal(int minCapacity) {
if (elementData == DEFAULTCAPACITY_EMPTY_ELEMENTDATA) {
minCapacity = Math.max(DEFAULT_CAPACITY, minCapacity);
}
ensureExplicitCapacity(minCapacity);
}
private void ensureExplicitCapacity(int minCapacity) {
modCount++;
// overflow-conscious code
if (minCapacity - elementData.length > 0)
grow(minCapacity);
}
/**
* The maximum size of array to allocate.
* Some VMs reserve some header words in an array.
* Attempts to allocate larger arrays may result in
* OutOfMemoryError: Requested array size exceeds VM limit
*/
private static final int MAX_ARRAY_SIZE = Integer.MAX_VALUE - 8;
/**
* Increases the capacity to ensure that it can hold at least the
* number of elements specified by the minimum capacity argument.
*
* @param minCapacity the desired minimum capacity
*/
private void grow(int minCapacity) {
// overflow-conscious code
int oldCapacity = elementData.length;
int newCapacity = oldCapacity + (oldCapacity >> 1);
if (newCapacity - minCapacity < 0)
newCapacity = minCapacity;
if (newCapacity - MAX_ARRAY_SIZE > 0)
newCapacity = hugeCapacity(minCapacity);
// minCapacity is usually close to size, so this is a win:
elementData = Arrays.copyOf(elementData, newCapacity);
}
当然是放出来你们自己看了，简单总结一下：
1、jdk1.7及之前，ArrayList初始容量是10，jdk1.8后也是10，哈哈(ಡωಡ)hiahiahia
/**
* Default initial capacity.
*/
private static final int DEFAULT_CAPACITY = 10;
不过jdk1.8后采用的是懒加载方式，就是一开始并没有对其进行初始化为10，而是给它一个空数组，但使用到时再进行加载扩容为10。不过你给定值的话就另说。
/**
* Constructs an empty list with the specified initial capacity.
*
* @param initialCapacity the initial capacity of the list
* @throws IllegalArgumentException if the specified initial capacity
* is negative
*/
public ArrayList(int initialCapacity) {
if (initialCapacity > 0) {
this.elementData = new Object[initialCapacity];
} else if (initialCapacity == 0) {
this.elementData = EMPTY_ELEMENTDATA;
} else {
throw new IllegalArgumentException("Illegal Capacity: "+
initialCapacity);
}
}
/**
* Constructs an empty list with an initial capacity of ten.
*/
public ArrayList() {
//DEFAULTCAPACITY_EMPTY_ELEMENTDATA是空数组
this.elementData = DEFAULTCAPACITY_EMPTY_ELEMENTDATA;
}
2、ArrayList默认是以自身的1.5倍进行扩容的，扩容的实现是通过grow方法实现的
/**
* Increases the capacity to ensure that it can hold at least the
* number of elements specified by the minimum capacity argument.
*
* @param minCapacity the desired minimum capacity
*/
private void grow(int minCapacity) {
// overflow-conscious code
int oldCapacity = elementData.length;
//这里实现了扩容，右移运算，右移1相当于除以2，所以是1.5倍
int newCapacity = oldCapacity + (oldCapacity >> 1);
if (newCapacity - minCapacity < 0)
newCapacity = minCapacity;
if (newCapacity - MAX_ARRAY_SIZE > 0)
newCapacity = hugeCapacity(minCapacity);
// minCapacity is usually close to size, so this is a win:
elementData = Arrays.copyOf(elementData, newCapacity);
}
主要就是前面两点吧，其他的自己看，我也不敢说我能看懂，了解主要的就行。
ArrayList就先讲到这里了。
1068
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
