数据结构与算法系列之＜2＞----动态数组(Part1)

1、什么是数据结构

• 数据结构是计算机存储、组织数据的方式

  1、线性结构：
  线性表（数组、链表、栈、队列、哈希表）
  2、树形结构
  二叉树、AVL树、红黑树、B树、堆、Trie、哈夫曼树、并查集
  3、图形结构
  邻接矩阵、邻接表

2、数组

• 数组是一种顺序存储的线性表，所有元素的内存地址是连续的
• 在很多编程语言中，数组都有一个缺点，就是无法动态修改容量。

3、数组代码设计

package com.jh;

import java.util.Iterator;

public class ArrayList {
	/**
	 *  多少个元素
	 */
	private int size;
	
	/**
	 * 存放元素
	 */
	private int[] elements;
	
	private static final int DEFAULT_CAPACITY = 10;
	private static final int ELEMENT_NOT_FOUND = -1;
	public ArrayList(int capacity) {
		capacity = (capacity < DEFAULT_CAPACITY) ? DEFAULT_CAPACITY : capacity;
		elements = new int[capacity];
	}
	
	public ArrayList() {
		this(DEFAULT_CAPACITY);
	}
	/**
	 * 清除所有元素
	 */
	public void clear() {
		size = 0;
	}
	
	/**
	 * 元素的数量
	 * @return
	 */
	public int size() {
		return size;
	}
	
	/**
	 * 是否为空
	 * @return
	 */
	public boolean isEmpty() {
		return size == 0;
	}
	
	/**
	 * 是否包含某个元素
	 * @param element
	 * @return
	 */
	public boolean contains(int element) {
		return indexOf(element) != ELEMENT_NOT_FOUND;
	}

	/**
	 * 添加元素到尾部
	 * @param element
	 */
	public void add(int element) {
//		elements[size++] = element;
		add(size, element);
	}
	
	/**
	 * 返回某个元素的索引
	 * @param index
	 * @return
	 */
	public int get(int index) {
		rangeCheck(index,false);
		
		return elements[index];
	}
	
	/**
	 * 设置位置的元素
	 * @param index
	 * @param element
	 * @return 原来的元素
	 */
	public int set(int index, int element) {
		rangeCheck(index,false);
		
		int old = elements[index];
		elements[index] = element;
		return old;
	}
	
	/**
	 * 在某个位置插入元素
	 * @param index
	 * @param element
	 */
	public void add(int index, int element) {
		rangeCheck(index,true);
		
		ensureCapacity(size + 1);
		for (int i = size - 1; i >= index; i--) {
			elements[i + 1] = elements[i];
		}
		elements[index] = element;
		size++;
	}
	
	
	/**
	 * 删除某个元素
	 * @param index
	 * @return
	 */
	public int remove(int index) {
		rangeCheck(index,false);
		
		int deleteElement = elements[index];
		for (int i = index + 1; i < size; i++) {
			elements[i - 1] = elements[i];
		}
		size--;
		return deleteElement;
	}
	
	/**
	 * 查看元素的索引
	 * @param element
	 * @return
	 */
	public int indexOf(int element) {
		for (int i = 0; i < size; i++) {
			if (elements[i] == element) return i;
			
		}
		return ELEMENT_NOT_FOUND;
	}
	
	@Override
	public String toString() {
		StringBuilder string = new StringBuilder();
		string.append("size ==").append(size).append(", [");
		for (int i = 0; i < size; i++) {
			string.append(elements[i]);
			
			if (i != size -1) {
				string.append(",");
			}
		}
		string.append("]");
		return string.toString();
	}
	
	
	private void rangeCheck(int index, boolean isForAdd) {
		if (index < 0 || (isForAdd ? (index > size) : (index >= size))) {
			throw new IndexOutOfBoundsException("Index:" + index + ", size:" + size);
		}
	}
	
	/**
	 * 保证容量
	 * @param capacity
	 */
	private void ensureCapacity(int capacity) {
		int oldCapacity = elements.length;
		System.out.println("oldCapacity:" + oldCapacity + "_" + "capacity:" + capacity);
		if (oldCapacity >= capacity) {
			return;
		}
		
		int newCapacity = oldCapacity + (oldCapacity >> 1);
		int[] newElements = new int[newCapacity];
		for (int i = 0; i < size; i++) {
			newElements[i] = elements[i];
		}
		elements = newElements;
		System.out.println("扩容了" + oldCapacity + "新容量：" + newCapacity);
	}
}

• 测试一下

package com.jh;

public class helloworld {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		System.out.println("Hello");
		ArrayList list = new ArrayList();
		list.add(11);
		list.add(22);
		list.add(33);
		list.add(44);
		list.add(55);
		list.add(66);
		System.out.println(list);
		
		int removeEle = list.remove(3);
		System.out.println(removeEle);
		System.out.println(list);
		
		
		list.add(2, 100);
		list.add(4, 200);
		list.add(6, 300);
		list.add(66);
		list.add(66);
		System.out.println(list);
		list.add(77);
		list.add(88);
		System.out.println(list);
	}

}

打印结果：
Hello
oldCapacity:10_capacity:1
oldCapacity:10_capacity:2
oldCapacity:10_capacity:3
oldCapacity:10_capacity:4
oldCapacity:10_capacity:5
oldCapacity:10_capacity:6
size ==6, [11,22,33,44,55,66]
44
size ==5, [11,22,33,55,66]
oldCapacity:10_capacity:6
oldCapacity:10_capacity:7
oldCapacity:10_capacity:8
oldCapacity:10_capacity:9
oldCapacity:10_capacity:10
size ==10, [11,22,100,33,200,55,300,66,66,66]
oldCapacity:10_capacity:11
扩容了10新容量：15
oldCapacity:15_capacity:12
size ==12, [11,22,100,33,200,55,300,66,66,66,77,88]