1、ArrayList扩容策略和容量的数量变化情况
ArrayList初始化大小为0,在添加第一个元素后大小扩容至10,当集合满了的时候,扩容至当前大小(为当前大小+当前大小 >> 1)的1.5倍即15,满了再扩至当前大小1.5倍,结束使用后记得调用释放内存接口trimToSize()。
注:可以通过debug,看到集合动态增长的数量变化:10->15->22->33->49->73->…
20200823补充源码ArrayList初始化过程,数组的大小变化
2、使用ArrayList实现stack的isEmpty(),pop(),peek(),push()
package com.secondphase.homework.day03;
import java.util.ArrayList;
import java.util.Arrays;
/**
* @Author jinman1012@qq.com 2020/8/13 20:31
* @Version 1.0
*/
public class Problem2 {
public static void main(String[] args) {
ArrayList<InternalError> stack = new ArrayList(Arrays.asList(1,2,3,4,5,6,7,8,9));
System.out.println(isEmpty(stack)? "空栈":"非空栈");
System.out.println((push(stack, (int) (Math.random()*100))?"压入成功,":"压入失败,")+"值为:" + peek(stack));
System.out.println("peek值为:" + peek(stack));
System.out.println("pop值为:" + pop(stack));
}
private static boolean isEmpty(ArrayList stack) {
return stack.size() == 0;
}
private static boolean push(ArrayList stack,int obj) {
return stack.add(obj);
}
private static Object peek(ArrayList stack) {
return stack.get(stack.size() - 1);
}
private static Object pop(ArrayList stack) {
return stack.remove(stack.size() - 1);
}
}