数组查找元素及其删除元素

package 算法demo;

public class array {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
          long arr[];int j;
          arr=new long[100];
          arr[0]=0;
          arr[1]=11;
          arr[2]=22;
          arr[3]=33;
          arr[4]=44;
          arr[5]=55;
          int nElems=6;
     for(j=0;j<nElems;j++)       //for each elements
    	 System.out.println(arr[j]);
     //search for key
     int searchKey=33;
     for(j=0;j<nElems;j++)
    	 if(arr[j]==searchKey)
    		 break;
       if(j==nElems)
    	   System.out.println("can not find it 33");
       else
    	   System.out.print("can find it 33"+"其下标是："+j);
       System.out.println("");
       //delete 22
       for(j=0;j<nElems;j++)
    	   if(arr[j]==22)
    		   break;
    	for(int k=j;k<nElems;k++)
    		arr[k]=arr[k+1];
    	nElems--;
    	for(j=0;j<nElems;j++)
    		System.out.print(+arr[j]+"");
	}

}

运行程序如下所示：