orderarray.java

java 数据结构的一些简单实例和一些线程的应用主要是面向初学者

import java.io.*;
class Order {
private int[]a;
private int length;

public Order(int max){
  a=new int[max];
  length=0;
}
public int size(){
	return length;
}

public void insert(int value){
    int i;
	for(i=0;i<length;i++)
	   if(a[i]>value)
		   break;
	for(int j=length;j>i;j--)
      a[j]=a[j-1];
	a[i]=value;
	length++;
}
public int Found(int value){
	int UppBound=length-1;
	int LowBound=0;
	int MiddlePosition;
	while(true){
		MiddlePosition=(UppBound+LowBound)/2;
		if(a[MiddlePosition]==value)
			return MiddlePosition;
		else if (LowBound>UppBound)
			return length;
		else{
	        if(a[MiddlePosition]>value)
			UppBound=MiddlePosition-1;
		    else if(a[MiddlePosition]<value)
			LowBound=MiddlePosition+1;
		    }
	}
}
public boolean delete(int value){
	int b=Found(value);
	if(a[b]==length)
		return false;
	else{
		for(int i=b;i<length;i++)
			a[i]=a[i+1];
		length--;
		return true;
	}
}
public void display(){
	for(int i=0;i<length;i++)
		System.out.println(a[i]);
}
}


class OrderArray{
	public static void main(String[] args) throws IOException{
		int max=100;
		Order arr;
		arr=new Order(max);
		arr.insert(1);
		arr.insert(7);
		arr.insert(44);
		arr.insert(9);
		arr.insert(8);
		arr.display();
		System.out.println("please enter the searchkey");
		int a=getInt();
		if(arr.Found(a)==arr.size())
			System.out.println(" can't found"+" "+a);
		else
			System.out.println("found"+" "+a);
		System.out.println("please enter the deleted key");
		int b=getInt();
		arr.delete(b);
		arr.display();
	}
    public static String getString()throws IOException
    {
    	InputStreamReader isr=new InputStreamReader(System.in);
    	BufferedReader br=new BufferedReader(isr);
    	String s=br.readLine();
    	return s;
    }
    public static int getInt()throws IOException
    {
    	String s=getString();
    	return Integer.parseInt(s);
    }
}