玩转数据结构
1.数组
使用泛型 -> 包装类
让我们的数据结构可以放置“任何”数据类型 每个基本数据类型都有对应的包装类
Boolean Byte Char Short Integer Long Float Double
均摊复杂度和防止复杂度的震荡:
假设capacity = n, n+1次addLast ,触发resize,总共进行2n+1次基本操作
平均,每次addLast操作,进行2次基本操作
这样均摊计算,时间复杂度是O(1)的!
复杂度震荡出现的原因:removeLast时resize过于着急(Eager)
解决方案:Lazy -> 当size ==capacity /4 时,才将capacity减半
//从数组中删除index位置的元素,返回删除的元素int O(n)
public E remove(int index){
if(index <0 || index >=size)
throw new IllegalArgumentException("Remove failed. 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 / 4 && data.length /2 != 0)
resize(data.length / 2);
return ret;
}
具体实现代码(Java):
Array.java
public class Array<E> {
private E[] data;
private int size;
//构造函数,传入数组的容量capacity构造Array
public Array(int capacity ){
data = (E[]) new Object[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;
}
//向所有元素后添加一个新元素 复用add逻辑
public void addLast(E e){
add(size, e);
} // O(1)
//在所有元素前添加一个新元素
public void addFirst(E e){
add(0,e);
} //O(n)
//在第index个位置插入一个新元素e (右移) O(n/2) = O(n)
public void add(int index,E e){
if(index <0 || index >size )
throw new IllegalArgumentException("Add failed. Require index >=0 and index <= size. ");
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 ++;
}
//获取index索引位置的元素 O(1)
public E get(int index){
if(index <0 ||index >=size)
throw new IllegalArgumentException("Get failed. Index is illegal.");
return data[index];
}
//修改index索引位置的元素为e O(1)
public void set(int index, E e){
if(index <0 ||index >=size)
throw new IllegalArgumentException("Get failed. Index is illegal.");
data[index] = e;
}
//查找数组中是否有元素e O(n)
public boolean contains(E e){
for (int i=0;i <size; i++){
if(data[i] .equals(e) ) //值比较
return true;
}
return false;
}
//查找数组中元素e所在的索引,如果不存在元素e,则返回-1 O(n)
public int find(E e){
for (int i=0;i < size; i++){
if(data[i] .equals(e))
return i;
}
return -1;
}
//从数组中删除index位置的元素,返回删除的元素int O(n)
public E remove(int index){
if(index <0 || index >=size)
throw new IllegalArgumentException("Remove failed. 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 / 4 && data.length /2 != 0)
resize(data.length / 2);
return ret;
}
//从数组中删除第一个元素,返回删除的元素 O(n)
public E removeFirst(){
return remove(0);
}
//从数组中删除最后一个元素,返回删除的元素 O(1)
public E removeLast(){
return remove(size-1);
}
//从数组中删除元素e
public void removeElement(E 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();
}
//实现动态数组 O(n)
private void resize(int newCapacity){
E[] newData = (E[]) new Object[newCapacity];
for(int i = 0; i< size; i ++)
newData[i] = data[i];
data = newData;
}
}
Main.java
public class Main {
public static void main(String[] args) {
Array<Integer> arr = new Array<>();
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);
}
}
Student.java 测试用
public class Student
{
private String name;
private int score;
public Student(String studentName,int studentScore){
name = studentName;
score = studentScore;
}
@Override
public String toString() {
return String.format("Student(name: %s, score: %d)", name, score);
}
public static void main(String[] args) {
Array<Student> arr = new Array<>();
arr.addLast(new Student("Alice",100));
arr.addLast(new Student("Bob",66));
arr.addLast(new Student("Charlie",88));
System.out.println(arr);
}
}