一维数组的增加，删除，找最大数

1，数组的增加   

package shuzu;

public class Shuzu {

 public int[] insertOneNum(int num[], int pos, int nums) {
       int[] numE = new int[num.length + 1]; 
            for (int i = 0; i < pos; i++) {
           numE[i] = num[i]; 
                  } 
 
           numE[pos] = nums; 

           for(int i = pos; i <num.length; i++) { 
                  numE[i + 1] = num[i];
            
          } 
           return numE; 
     }
 
      public static void main(String[] args) {
        int[] num = new int[] { 2, 4, 5, 1, 6, 0 };
           
               Shuzu sz = new Shuzu();// 声明一个对象
        num=sz.insertOneNum(num,3,3); 
        for(int i=0;i<num.length;i++){
          System.out.print(num[i]+" ");
          }
   }
}

执行是结果：2, 4, 5,3，1, 6,

2，删除一个数

package shuzu;

public class Shuzu {
     public void deleOneNum(int[] num, int pos) {
        for (int i = pos; i < num.length; i++) {
            num[i - 1] = num[i];
        }

    }
    public static void main(String[] args) {
     int[] num = new int[] { 2, 4, 5, 1, 6, 0 }; 
             Shuzu dz=new Shuzu();
              dz.deleOneNum(num,1); 
             for(int i=0;i<num.length;i++){ 
             System.out.print(num[i]+" ");
           }
       }
}

执行的结果是：4 5 1 6 0 0

3.找最大的数

  

package shuzu;

public class Shuzu {
   public int findOneNum(int[] num) {
        int Max = num[0];
        for (int i = 0; i < num.length; i++) {
            if (Max < num[i]) {
                Max = num[i];
            }
        }
        return Max;
    }
 
   public static void main(String[] args) {
        int[] num = new int[] { 2, 4, 5, 1, 6, 0 };
               
                Shuzu fO = new Shuzu();
        int Max = 0;
        Max = fO.findOneNum(num);
        System.out.print("最大数是=" + Max);
          }
  }

执行的结果是：最大数是=6

4，找出数组中不同的数

   

package shuzu;

public class Shuzu {
   public void findNuml(int[] nums){
        int j;
        int[] temp=new int[nums.length];
        
        for(int i=0;i<nums.length;i++){
            
            for( j=0;j<i;j++) {
               
                if(nums[j]==nums[i]) 
                
                    break;
               }
           
            
            if(i==j){
                
                System.out.print(nums[i]+" "); 
               }
            }
         
    }
      

  public static void main(String[] args) {
       int[] nums=new int[] {1,1,3,4,1,4,5,3,1,65,3};
    Shuzu Fz=new Shuzu();
    Fz.findNuml(nums);
        }
  }

输出的结果：1 3 4 5 65