可怕的算法,躲不掉的,开始学习
数据结构与算法:
数组:
自己实现一个Array class
简单版
package simple;
import java.util.Arrays;
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 getCapacity() {
return data.length;
}
//获取数组中的元素个数
public int getSize() {
return size;
}
// 返回数组是否为空
public boolean isEmpty() {
return size == 0;
}
// 在所有元素前添加一个新元素
public void addFirst(int e) {
add(0, e);
}
// 向所有元素后添加一个新元素
public void addLast(int e) {
add(size, e);
}
//在index索引的位置插入一个新元素e
public void add(int index, int e) {
if (size == data.length) {
throw new IllegalArgumentException("Add failed. simple.Array is full.");
}
if (index < 0 || index > size) {
throw new IllegalArgumentException("Add failed. Require index >= 0 and index <= size.");
}
for (int i = size - 1; i >= index; i--) {
data[i + 1] = data[i]; //往后移一位,但是index的数字是不变的
}
data[index] = e; //更改index的数字
size++;
}
//获取index索引位置的元素
public int get(int index) {
if (index < 0 || index >= size) {
throw new IllegalArgumentException("Get failed. Index is illegal.");
}
return data[index];
}
//修改index索引位置的元素为e
public void set(int index, int e) {
if (index < 0 || index >= size) {
throw new IllegalArgumentException("Get failed. Index is illegal.");
}
data[index] = e;
}
//查找数组中是否有元素e
public boolean contains(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;
}
//从数组中删除index位置的元素,返回删除的元素
public int remove(int index) {
if (index < 0 || index >= size) {
throw new IllegalArgumentException("Remove failed. 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);
}
//从数组中删除元素e
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("simple.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();
}
}
测试类:
package simple;
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.addFirst(100);
System.out.println(arr);
arr.add(0,101);
System.out.println(arr);
arr.set(0,199);
System.out.println(arr.get(0));
arr.remove(0);
System.out.println(arr);
arr.removeElement(4);
System.out.println(arr);
arr.removeFirst();
System.out.println(arr);
}
}
中级版
package advanced;
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 getCapacity() {
return data.length;
}
//获取数组中的元素的个数
public int getSize() {
return size;
}
//返回数组是否为空
public boolean isEmpty() {
return size == 0;
}
//在index索引的位置插入一个新元素e
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++;
}
//向所有元素后添加一个新元素
public void addLast(E e) {
add(size, e);
}
//在所有元素前添加一个新元素
public void addFirst(E e) {
add(0, e);
}
//获取index索引位置的元素
public E get(int index) {
if (index < 0 || index >= size) {
throw new IllegalArgumentException("Get failed. Index is illegal.");
}
return data[index];
}
public void set(int index, E e) {
if (index < 0 || index >= size)
throw new IllegalArgumentException("Set failed. Index is illegal.");
data[index] = e;
}
//查找数组中是否有元素e
public boolean contains(E e) {
for (int i = 0; i < size; i++) {
if (data[i].equals(e)) {
return true;
}
}
return false;
}
//查找数组中元素e所在的索引,如果不存在元素e,则返回-1
public int find(E e) {
for (int i = 0; i < size; i++) {
if (data[i].equals(e)) {
return i;
}
}
return -1;
}
//从数组中删除index位置的元素,返回删除的元素
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;
}
//从数组中删除第一个元素,返回删除的元素
public E removeFirst() {
return remove(0);
}
//从数组中删除最后一个元素,返回删除的元素
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();
}
private void resize(int newCapacity) {
E[] newData = (E[]) new Object[newCapacity];
for (int i = 0; i < size; i++) {
newData[i] = data[i];
}
data = newData;
}
}
测试类:
package advanced;
public class Main {
public static void main(String[] args) {
Array<Integer> arr = new Array<>(10);
for (int i = 0; i < 9; i++)
arr.addLast(i);
System.out.println(arr);
arr.add(1, 100);
System.out.println(arr);
arr.addFirst(-1);
System.out.println(arr);
// [-1, 0, 100, 1, 2, 3, 4, 5, 6, 7, 8, 9]
arr.remove(2);
System.out.println(arr);
arr.removeElement(4);
System.out.println(arr);
arr.removeFirst();
System.out.println(arr);
arr.removeFirst();
arr.removeFirst();
arr.removeFirst();
arr.removeFirst();
arr.removeFirst();
arr.removeFirst();
arr.removeFirst();
System.out.println(arr);
}
}
测试类student
package advanced;
public class Student {
private String name;
private int score;
public Student(){
}
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);
}
}
高级版:
去看Arraylist