||
Java-array用法范例:-排序-求最大与最小值-查找 |
作者:hugewisdom 提交日期:2009-3-16 14:44:00 |
范例1: public class arrayc { public static void main(String args[]) { int i; int a[]={15,6,8,9}; for(i=0;i<A.LENGTH;I++) System.out.print("a["+i+"]="+a[i]+",\t"); System.out.println(a.length); } } 范例2: public class arrayc { public static void main(String args[]) { int i; int a[]=new int[3]; for(i=0;i<3;i++) System.out.println("a["+i+"]="+a[i]+",\t"); System.out.println("the length of the array is"+a.length); } } 范例3:求一组数组的中的最大与最小值: public class arrayc { public static void main(String args[]) { int i,max,min; int a[]={58,25,65,23,56,58,98,154}; min=max=a[0]; System.out.println("elements in array a are"); for(i=0;i<A.LENGTH;I++) { System.out.print(a[i]+" "); if(a[i]>max) max=a[i]; if(a[i]<MIN) min=a[i]; } System.out.println("\n the max value is"+max); System.out.println("the min value is"+min); } } 范例4:二维数组: public class arrayc { public static void main(String[] args) { int[][] values ={{1,2},{3,4}}; int sum=0; System.out.println("the array length="+values.length); System.out.println("elements in the array are"); for(int i=0;i<VALUES.LENGTH;I++) for(int j=0;j<VALUES[0].LENGTH;J++) { sum+=values[i][j]; System.out.println(values[i][j]); } System.out.println("the sum="+sum); } } 范例5:求最大与最小值的另一中方法: public class arrayc { public static void main(String args[]) { int a[]={14,25,36,47,58,69}; max(a); } static void max(int b[]) { int ma,mi; ma=mi=b[0]; for(int i=0;i<B.LENGTH;I++) if(b[i]>ma) ma=b[i]; else if(b[i]<MI) mi=b[i]; System.out.println("the length of the array is"+b.length); System.out.println("the max number is="+ma); System.out.println("the min number is="+mi); } } 范例7:二维数组: public class arrayc { public static void main(String args[]) { int a[][]={{12,25,24,16,13},{15,28,16,17,17,15}}; printarray(a); } static void printarray(int b[][]) { for(int i=0;i<B.LENGTH;I++) { for(int j=0;j<B[I].LENGTH;J++) System.out.print(b[i][j]+" "); System.out.println(); } } } 范例8:数组的排序方法1: public class arraysort { public static void main(String args[]) { int myarray[]= {55,2,6,4,32,12,-9,73,26,37}; System.out.println("原始数据为"); for(int i=0;i<MYARRAY.LENGTH;I++) { System.out.print(myarray[i]+" ,"); } arraysort myarraysort=new arraysort(); int[] result=myarraysort.sort(myarray); System.out.println("\n排序后的数据"); for(int i=0;i<RESULT.LENGTH;I++) { System.out.print(result[i]+" ,"); } } public int[] sort(int a[]) { int temp,size=a.length; for(int i=size-1;i>=1;i--) { boolean end=true; for(int j=0;j<I;J++) { if(a[j]>a[j+1]) { temp=a[j]; a[j]=a[j+1]; a[j+1]=temp; end=false; } } if(end==true) { break; } } return a; } } 范例9:数组排序的第二中方法 class arraysort { public static void main(String args[]) { int n; int a[]=new int[1]; int b[]={20,36,25,69,47,45,46,98}; System.out.println("排序前:"); for(n=0;n<B.LENGTH;N++) System.out.print(" "+b[n]); for(int i=0;i<B.LENGTH-1;I++) for(int j=i+1;j<B.LENGTH;J++) { if(b[i]>b[j]) { a[0]=b[i]; b[i]=b[j]; b[j]=a[0]; } } System.out.println("\n排序后:"); for(int m=0;m<B.LENGTH;M++) { System.out.print(" "+b[m]); } } } 范例10:数组的查询方法: import java.io.*; class arraysearch { public static void main(String args[]) throws IOException { BufferedReader mybuf=new BufferedReader(new InputStreamReader(System.in)); int search=0; String mystring; int[] a={25,23,21,32,36,35,34,58,69,54,47}; System.out.println("数组 a 所包含的元素为:"); for(int i=0;i<A.LENGTH;I++) { System.out.print(" "+a[i]); } System.out.println("\n请输入你所要查询的元素"); try { mystring=mybuf.readLine(); search=Integer.parseInt(mystring); }catch(Exception e){}; boolean found=false; int j; for(j=0;j<A.LENGTH;J++) { if(a[j]==search) { found=true; break; } } if(found==true) { System.out.println("找到了"+search+"的位置在"+j); } else { System.out.println(search+"不在数组的范围内,请重新输入"); } } } |
手机版|北京交通大学论坛-知行信息交流平台 ( BJTUICP备13011901号 )
GMT+8, 2023-6-2 16:31
Powered by Discuz! X3.4
Copyright © 2001-2020, Tencent Cloud.