java容器底层实现原理_理解java容器底层原理--手动实现ArrayList

为了照顾初学者,我分几分版本发出来

版本一:基础版本

实现对象创建、元素添加、重新toString() 方法

package com.xzlf.collection;

/**

* 自定义一个ArrayList,体会底层实现原理

* 初始版本

* @author xzlf

*

* @param

*/

public class MyArrayList {

private Object[] elementDate;

private int size;

private static final int DEFAULT_CAPACITY = 10;

public MyArrayList() {

elementDate = new Object[DEFAULT_CAPACITY];

}

public MyArrayList(int capacity) {

elementDate = new Object[capacity];

}

public void add(E element) {

elementDate[size++] = element;

}

@Override

public String toString() {

StringBuilder sb = new StringBuilder("[");

for (int i = 0; i < size; i++) {

sb.append(elementDate[i] + ",");

}

sb.setCharAt(sb.length() - 1, ']');

return sb.toString();

}

public static void main(String[] args) {

MyArrayList list = new MyArrayList(20);

list.add("aa");

list.add("bb");

list.add("cc");

System.out.println(list);

}

}

测试运行

59849d3ed04b68e1f3e36f7e415aec57.png

版本二:增加扩容

package com.xzlf.collection;

/**

* 自定义一个ArrayList,体会底层实现原理

* 增加扩容

* @author xzlf

*

* @param

*/

public class MyArrayList2 {

private Object[] elementDate;

private int size;

private static final int DEFAULT_CAPACITY = 10;

public MyArrayList2() {

elementDate = new Object[DEFAULT_CAPACITY];

}

public MyArrayList2(int capacity) {

elementDate = new Object[capacity];

}

public void add(E element) {

// 元素个数等于数组长度时 进行扩容操作

if(size == elementDate.length) {

Object[] newArray = new Object[elementDate.length + (elementDate.length >> 1)];

System.arraycopy(elementDate, 0, newArray, 0, elementDate.length);

elementDate = newArray;

}

elementDate[size++] = element;

}

@Override

public String toString() {

StringBuilder sb = new StringBuilder("[");

for (int i = 0; i < size; i++) {

sb.append(elementDate[i] + ",");

}

sb.setCharAt(sb.length() - 1, ']');

return sb.toString();

}

public static void main(String[] args) {

MyArrayList2 list = new MyArrayList2();

for (int i = 0; i < 15; i++) {

list.add("aa" + i);

}

System.out.println(list);

}

}

测试:

2dfe7dcd39057d54ade5bb5e90cf6163.png

版本三:添加get set方法以及数组边界检查

package com.xzlf.collection;

/**

* 增加get set 方法

* 增加数组边界检查

* @author xzlf

*

* @param

*/

public class MyArrayList3 {

private Object[] elementDate;

private int size;

private static final int DEFAULT_CAPACITY = 10;

public MyArrayList3() {

elementDate = new Object[DEFAULT_CAPACITY];

}

public MyArrayList3(int capacity) {

if(capacity < 0) {

throw new RuntimeException("数组容量不能为负数");

}else if(capacity == 0) {

elementDate = new Object[DEFAULT_CAPACITY];

}

elementDate = new Object[capacity];

}

public void add(E element) {

// 元素个数等于数组长度时 进行扩容操作

if(size == elementDate.length) {

Object[] newArray = new Object[elementDate.length + (elementDate.length >> 1)];

System.arraycopy(elementDate, 0, newArray, 0, elementDate.length);

elementDate = newArray;

}

elementDate[size++] = element;

}

public E get(int index) {

checkRange(index);

return (E) elementDate[index];

}

public void set(E element, int index) {

checkRange(index);

elementDate[index] = element;

}

public void checkRange(int index) {

// 索引合法判断[0,size)

if(index < 0 || index > size -1) {

throw new RuntimeException("索引不合法:" + index);

}

}

@Override

public String toString() {

StringBuilder sb = new StringBuilder("[");

for (int i = 0; i < size; i++) {

sb.append(elementDate[i] + ",");

}

sb.setCharAt(sb.length() - 1, ']');

return sb.toString();

}

public static void main(String[] args) {

MyArrayList3 list = new MyArrayList3();

for (int i = 0; i < 15; i++) {

list.add("aa" + i);

}

System.out.println(list);

System.out.println(list.get(10));

list.set("bb", 10);

System.out.println(list.get(10));

System.out.println(list.get(-10));

}

}

测试:

4899e8d7edc48778580d118450f4c698.png

版本四:增加remove、size、isEmpty

package com.xzlf.collection;

/**

* 增加remove()

* 增加size isEmpty

* @author xzlf

*

* @param

*/

public class MyArrayList4 {

private Object[] elementDate;

private int size;

private static final int DEFAULT_CAPACITY = 10;

public MyArrayList4() {

elementDate = new Object[DEFAULT_CAPACITY];

}

public MyArrayList4(int capacity) {

if(capacity < 0) {

throw new RuntimeException("数组容量不能为负数");

}else if(capacity == 0) {

elementDate = new Object[DEFAULT_CAPACITY];

}

elementDate = new Object[capacity];

}

public void add(E element) {

// 元素个数等于数组长度时 进行扩容操作

if(size == elementDate.length) {

Object[] newArray = new Object[elementDate.length + (elementDate.length >> 1)];

System.arraycopy(elementDate, 0, newArray, 0, elementDate.length);

elementDate = newArray;

}

elementDate[size++] = element;

}

public E get(int index) {

checkRange(index);

return (E) elementDate[index];

}

public void set(E element, int index) {

checkRange(index);

elementDate[index] = element;

}

public void checkRange(int index) {

// 索引合法判断[0,size)

if(index < 0 || index > size -1) {

throw new RuntimeException("索引不合法:" + index);

}

}

public void remove(int index) {

int numMoved = size - index -1;

if(numMoved > 0) {

System.arraycopy(elementDate, index+1, elementDate, index, numMoved);

}

elementDate[--size] = null;

}

public void remove(E element) {

// 遍历所有元素,和传入的element比较,获取第一个为true的位置 删除

for (int i = 0; i < size; i++) {

if(element.equals(get(i))) {

remove(i);

}

}

}

public int size() {

return size;

}

public boolean isEmpty() {

return size == 0;

}

@Override

public String toString() {

StringBuilder sb = new StringBuilder("[");

for (int i = 0; i < size; i++) {

sb.append(elementDate[i] + ",");

}

sb.setCharAt(sb.length() - 1, ']');

return sb.toString();

}

public static void main(String[] args) {

MyArrayList4 list = new MyArrayList4();

for (int i = 0; i < 15; i++) {

list.add("aa" + i);

}

System.out.println(list);

list.remove("aa7");

System.out.println(list);

list.remove(3);

System.out.println(list);

System.out.println(list.size());

System.out.println(list.isEmpty());

}

}

测试:

0bad8e2ede9b60d683587115e093b3ff.png

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值