面向对象的数组Java

// 这些代码相当于了解实现的原理和了解简单的查找
import java.util.Arrays;

public class MyArray {
	private int[] elements;
	
	public MyArray(){
		elements = new int[0];
	}
	
	public int size(){
		return elements.length;
	}
	
	public void add(int element){
//		创建一个新的数组
		int[] newArr = new int[elements.length+1];
//		先把原数组中的元素复制到新数组里
		for (int i = 0; i < elements.length; i++) {
			newArr[i] = elements[i];
		}
//		再把想要添加的数添加进来
		newArr[elements.length] = element;
		elements = newArr;
	}
	
	public void show(){
		System.out.println(Arrays.toString(elements));
	}
	
	
	public void delete(int index){
		if(index < 0 || index > elements.length-1){
			throw new IndexOutOfBoundsException();
		}
		
		int[] newArr = new int[elements.length-1];
		for (int i = 0; i < newArr.length; i++) {
			if(i<index){
				newArr[i] = elements[i];
			}else {
				newArr[i] = elements[i+1];
			}
		}
		elements = newArr;
	}
	
	
	public int get(int index){
		return elements[index];
	}
	
	
	public void inset(int index,int element){
		int[] newArr = new int [elements.length+1];
		for(int i = 0; i < elements.length; i++){
			if(i<index){
				newArr[i] = elements[i];
			}else {
				newArr[i+1] = elements[i];
			}
		}
		newArr[index] = element;
		elements = newArr;
 	}
	
	
	public void set(int index,int element){
		if(index < 0 || index > elements.length-1){
			throw new IndexOutOfBoundsException();
		}
		elements[index] = element;
	}
	
	
	//线性查找
	public int search(int target){
		for (int i = 0; i < elements.length; i++) {
			if(target == elements[i]){
				return i;
			}
		}
		return -1;
	}
	
	
//	二分查找
	public int binarySearch(int target){
		int begin = 0;
		int end = elements.length-1;
		int mid = (begin+end)/2;
		while(true){
			if(begin >= end){
				return -1;
			}
			
			if(target == elements[mid]){
				return mid;
			}else if (target < elements[mid]) {
				end = mid-1;
			}else {
				begin = mid+1;
			}
			mid = (begin+end)/2;
		}
		
	}
	
}

 

 

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

		
//		创建一个可变的数组
		MyArray ma = new MyArray();
//		获取长度
		int size = ma.size();
		System.out.println(size);
		
		ma.add(5);
		ma.add(5);
		ma.add(4);
		ma.add(5);
		ma.show();
		
		ma.delete(2);
		ma.show();
		
		System.out.println("------------");
		ma.inset(1, 3);
		ma.show();
		System.out.println("------------");
		
		int index=ma.search(6);
		int index2=ma.binarySearch(2);
		System.out.println(index);
		System.out.println(index2);
	}
}

运行结果是：

0
[5, 5, 4, 5]
[5, 5, 5]
------------
[5, 3, 5, 5]
------------
-1
-1