不要小瞧数组！[数据结构与算法]

---

title: 不要小瞧数组！[数据结构与算法]
date: 2020-04-04 18:18:22
author: JF
blog：https://www.huqifa.com/
tags:
- 数据结构与算法
- Java
categories:
- 数据结构与算法

---

为什么要学习数据结构？

• 数据结构是所有计算机专业的同学必学的课程
• 数据结构研究的是数据如何在计算机中进行组织和存储，使得我们可以高效的获取数据或者修改数据

---

数据结构 + 算法 = 程序

面向面试

1. 数组
2. 栈
3. 队列
4. 链表
5. 二分搜索树
6. 堆

面向竞赛

1. 线段树
2. Trie
3. 并查集

不要小瞧数组！

• 数组的基础就是把数据码成一排进行存放

package cn.shuzu;
/**
 * 
 * @author HQF
 *
 */
public class Array {
	private int[] data;
	private int size;
	
	//构造函数，传入数组的容量capacity构造Array
	public Array(int capacity) {
		data = new int[capacity];
		size = 0;
	}
	
	//无参的构造函数，默认数组的容量capacity = 10
	public Array() {
		this(10);
	}
	
	public int getsize() {
		return size;
	}
	
	public int getCapacity() {
		return data.length;
	}
	
	public boolean isEmpty() {
		return size == 0;
	}
	
}

1. 向数组中添加元素

package cn.shuzu;
/**
 * 
 * @author HQF
 *
 */
public class Array {
	private int[] data;
	private int size;
	
	//构造函数，传入数组的容量capacity构造Array
	public Array(int capacity) {
		data = new int[capacity];
		size = 0;
	}
	
	//无参的构造函数，默认数组的容量capacity = 10
	public Array() {
		this(10);
	}
	
	public int getsize() {
		return size;
	}
	
	public int getCapacity() {
		return data.length;
	}
	
	public boolean isEmpty() {
		return size == 0;
	}
	
	//向所有元素后添加一个新元素
	public void addLast(int e) {
		add(size, e);
	}
	
	//向任意位置添加元素
	public void add(int index,int e) {
		if (size == data.length) 
			throw new IllegalArgumentException("AddLast failed. Array is full.");
	    if (index<0 || index>size) 
			throw new IllegalArgumentException("AddLast failed. Array is full."); 
		
		for (int i = size-1; i >= index; i --) 
			data[i+1] = data[i];
		
		data[index] = e;
		size++;
	}
	
	//向数组开头加添元素
	public void addFirst(int e) {
		add(0, e);
	}
	
}

package cn.shuzu;

public class Main {
    public static void main(String[] args) {

        Array arr = new Array(20);
        for (int i = 0; i < 10; i++) {
			arr.addLast(i);
		}
        System.out.println(arr);
        
        arr.add(1, 100);
        System.out.println(arr);

        arr.addFirst(-1);
        System.out.println(arr);
    }
}

2. 在数组中查询元素和修改元素

package cn.shuzu;

import java.awt.Container;

/**
 * 
 * @author HQF
 *
 */
public class Array {
	private int[] data;
	private int size;
	
	//构造函数，传入数组的容量capacity构造Array
	public Array(int capacity) {
		data = new int[capacity];
		size = 0;
	}
	
	//无参的构造函数，默认数组的容量capacity = 10
	public Array() {
		this(10);
	}
	
	public int getsize() {
		return size;
	}
	
	public int getCapacity() {
		return data.length;
	}
	
	public boolean isEmpty() {
		return size == 0;
	}
	
	//向所有元素后添加一个新元素
	public void addLast(int e) {
		add(size, e);
	}
	
	//向任意位置添加元素
	public void add(int index,int e) {
		if (size == data.length) 
			throw new IllegalArgumentException("AddLast failed. Array is full.");
	    if (index<0 || index>size) 
			throw new IllegalArgumentException("AddLast failed. Array is full."); 
		
		for (int i = size-1; i >= index; i --) 
			data[i+1] = data[i];
		
		data[index] = e;
		size++;
	}
	
	//向数组开头加添元素
	public void addFirst(int e) {
		add(0, e);
	}
	
	//查找数组中是否有元素e
	public boolean container(int e) {
		for (int i = 0; i < size; i++) {
			if (data[i] == e) return true;
		}
		return false;
	}
	
	//查找数组中元素e所在的索引，如果不存在元素e，则返回-1
	public int find(int e) {
		for (int i = 0; i < size; i++) {
			if (data[i] == e) return i;
		}
		return -1;
	}
	
	//删除元素
	public int remove(int index) {
		if (index < 0 || index >= size) 
			throw new IllegalArgumentException("Index is illegal.");
	int ret = data[index];
	for (int i = index+1; i < size; i++) {
		data[i-1] = data[i];
	}
	size--;
	return ret;
	}
	
	//从数组中删除第一个元素，返回删除的元素
	public int removeFirst() {
		return remove(0);
	}
		
	//从数组中删除最后一个元素，返回数组的元素
	public int removeLast() {
		return remove(size-1);
	}
	
	//查找数组中是否有指定元素，如果有则删除
	public void removeElement(int e)
	{
		int index = find(e);
		if (index != -1) {
			remove(index);
		}
	}
	
	//输出
	@Override
 	public String toString() {
		StringBuilder  res = new StringBuilder();
		res.append(String.format("Array: size = %d,Capacity = %d\n", size,data.length));
		res.append('[');
		for (int i = 0; i < size; i++) {
			res.append(data[i]);
			if (i != size -1) {
				res.append(",");
			}
		}
		res.append(']');
		return res.toString();
	}

	//获取index索引位置的元素
	int get(int index) {
		if (index < 0 || index >= size) {
			throw new IllegalArgumentException("Index is illegal.");
		}
		return data[index];
	}
	
	//对数组元素进行更新
	void set(int index,int e) {
		if (index < 0 || index >= size) {
			throw new IllegalArgumentException("Index is illegal.");
	}
		data[index] = e;
}
}

package cn.shuzu;

public class Main {
    public static void main(String[] args) {

        Array arr = new Array(20);
        for (int i = 0; i < 10; i++) {
			arr.addLast(i);
		}
        System.out.println(arr);
        
        arr.add(1, 100);
        System.out.println(arr);

        arr.addFirst(-1);
        System.out.println(arr);

        arr.remove(2);
        System.out.println(arr);

        arr.removeElement(4);
        System.out.println(arr);
        
        arr.removeFirst();
        System.out.println(arr);
        
    }
}

Array: size = 10,Capacity = 20
[0,1,2,3,4,5,6,7,8,9]
Array: size = 11,Capacity = 20
[0,100,1,2,3,4,5,6,7,8,9]
Array: size = 12,Capacity = 20
[-1,0,100,1,2,3,4,5,6,7,8,9]
Array: size = 11,Capacity = 20
[-1,0,1,2,3,4,5,6,7,8,9]
Array: size = 10,Capacity = 20
[-1,0,1,2,3,5,6,7,8,9]
Array: size = 9,Capacity = 20
[0,1,2,3,5,6,7,8,9]

使用泛型

• 让我们的数据机构可以放置“任何”数据类型
• 不可以是基本数据类型，只能是类对象。

(boolean, byte, char, short, int, long, float, double)

• 每个基本数据类型都有相应的包装类

(Boolean, Byte, Char, Short, Int, Long, Float, Double)

动态数组

在静态数组中如果数组满了就要进行动态扩容。

	private void resize(int newCapacity) {
		E[] newData = (E[])new Object[newCapacity];
		for (int i = 0; i < size; i++) {
			newData[i] = data[i];
		}
		data = newData;
	}

	public void add(int index,E e) {
	 if (index<0 || index>size) 
			throw new IllegalArgumentException("AddLast failed. Array is full."); 
		
		if (size == data.length) 
			resize(2*data.length);	
			
		for (int i = size-1; i >= index; i --) 
			data[i+1] = data[i];
		
		data[index] = e;
		size++;
	}

//在移除数组元素的过程中，如果数组长度小于容量的一半就进行缩容
	public E remove(int index) {
		if (index < 0 || index >= size) 
			throw new IllegalArgumentException("Index is illegal.");
	E ret = data[index];
	for (int i = index+1; i < size; i++) {
		data[i-1] = data[i];
	}
	size--;
	data[size] = null;//loitering objects != memory leak
	
	if (size == data.length/2) {
		resize(data.length/2);
	}
	return ret;
	}